Professor Painter

Пікірлер

@Didier-cu6cb 2 күн бұрын

3:33 what? how it turns out as (n to the power of 1.5) ? sry i dont undrestand that

@hawaiho 3 күн бұрын

WOW !

@qwerty5035 4 күн бұрын

Thank you so much Sir🖤🖤

@manalali2939 5 күн бұрын

thanks so much

@avakanksh 8 күн бұрын

at 1:08 the value is not 2^5 its actually 5^2. pls correct me if i am wrong.

@muhannedalogaidi7877 12 күн бұрын

I Recommended your Channel honestly, posted on LinkedIn

@kallihale5197 14 күн бұрын

🐐🐐🐐

@LucyLi-w2j 15 күн бұрын

This is a very great problem. Appreciate your help! :)

@noahgsolomon 16 күн бұрын

im cooked chat

@jzov 19 күн бұрын

Dr Painter living a happy and fulfilling life 4K HDR [FULL MOVIE]

@JikeWimblik 19 күн бұрын

In sudoku If you call a group of possible numbers from all the possible numbers in a cell 1, then the dance of the 1's can begin. There should be x(how many numbers in your grouping) per adjacent row column and sub grid and you can test your guess or multiple guesses at once against other groupings upgrading until you end up squeezing to many 1's into a row colmn or subgrid and find a conflict or you solve the grid if the grid is solvable. Magic is real see. This encoding might lead to a p time solution who knows.

@seyma6147 19 күн бұрын

thank you sir

@sebastianking657 22 күн бұрын

@Munto-Z 22 күн бұрын

Thank you so much, professor. You have no idea how much time you've saved me.

@muhannedalogaidi7877 24 күн бұрын

Great

@LongNguyen-ko2pv 25 күн бұрын

are u chinese ?

@lolololhahahah 26 күн бұрын

binus binus binus

@eliastefera8574 26 күн бұрын

I've seen so many videos on KZbin about Red Black Trees, this one is by far the best explanation I've seen so far.

@EpicDinoDragon5768 Ай бұрын

this is peak.

@climito Ай бұрын

Basically what you are doing is a binary search for the lower bound, isn it?

@faris8537 Ай бұрын

you are my hero!

@Spikezz3 Ай бұрын

Your explanation is spot on!

@climito Ай бұрын

I dont understand how underrated this channel is. Glorious.

@climito Ай бұрын

this is gold guys

@climito Ай бұрын

Can you provide some books to learn all of this with the "tricks" that you use for the asymptotic notation? I have been using the Discrete math by Rosen but the section about algorithms is so poor. Thanks a lot!

@climito Ай бұрын

as a self-taught person, I have found THE professor. It is, by large, better explained than any book that I used for learning this topic. Thanks so much, hopefully in the future all of this content can be improved and expanded in an online course and also include the "as we saw in the foundations..."

@RdX.369 Ай бұрын

It is a contradiction. Since x ≠ y, (x-y)² ≠ 0 ; Also the square of any real numbers is always nonnegative

@kallihale5197 Ай бұрын

🐐🐐🐐

@kallihale5197 Ай бұрын

stop the pun in the title 😭it took me a while

@kallihale5197 Ай бұрын

one of the most criminally underrated channels. I wish you were my algo professor

@salmasalah7940 Ай бұрын

Thanks

@diegoarroyo4951 Ай бұрын

is this ASMR

@patrick-Gould Ай бұрын

>:(

@labuddha Ай бұрын

great content

@user-pj2pi1ob4m Ай бұрын

poor explanation if values are chose as c=3 after and right after n0=4 which means n=5 ıt wont satisy condition=

@idafoh34 Ай бұрын

thank you!

@bestlife7578 Ай бұрын

Que animación tan buena!

@ncsredemption8942 Ай бұрын

Came to this video because I was confused by my professor's explanation. This was much clearer. Thank you!

@antooooo130 Ай бұрын

excelent explanation!

@chaos00000 Ай бұрын

The clearest explanation I've seen....

@offthepathworks9171 Ай бұрын

Properly analyzing code? Could you please expand - great series btw :).

@Unstable_Diffusion89 Ай бұрын

Correct me if im wrong but you do not swap the root and the tail, you just update the tail to the root? Shouldn’t there be A[1] = A[size] A[size] = maxKey So concretely, you put 48 at the end of the array but keep 48 at the root, instead of remembering to put 11 up at the root and then pushing it down the tree

@domojestic4155 Ай бұрын

If you did it that way, you would lose your 11. The point of the function is to pop off the maximum value and then keep all your remaining values; the way you describe it would pop the max value, and then erroneously delete the current last value in the heap. On top of that, you would fail to delete the original max value, since you would have just made a duplicate.

@JikeWimblik Ай бұрын

Theorem: The proposed Sudoku solving algorithm, which utilizes a 45-grid encoding and a 2-SAT solver to iteratively identify and eliminate invalid '1' placements, has a polynomial-time complexity. Proof: * Sudoku Encoding and Problem Structure: * The Sudoku puzzle is encoded using 45 grids, where each grid corresponds to a specific number (1-9) and a specific position within a 3x3 subgrid. * Each grid contains '1's representing the presence of that number in the corresponding cells and '2's representing its absence. * Crucially: Each grid must have exactly two '1's to satisfy the Sudoku constraints (one number appears twice within its row, column, and 3x3 subgrid). This limited capacity is key to the algorithm's efficiency. * Algorithm Description: a) Initialization: All possible '1' placements across all 45 grids are considered. b) Iteration: i. 2-SAT Solver and Invalid '1' Identification: For each grid, a 2-SAT instance is constructed based on the current '1' placements and the Sudoku constraints (row, column, and subgrid). The 2-SAT solver checks the satisfiability of these constraints. Since each grid can only have two '1's, attempting to place more will inevitably lead to an unsatisfiable instance, revealing at least one invalid '1' placement within that grid. ii. Elimination: The identified invalid '1' placement is marked, permanently eliminating that possibility. iii. Constraint Propagation: The information from the invalid placement is propagated to other grids, potentially identifying more invalid placements due to shared constraints (same row, column, or 3x3 subgrid). c) Termination: The algorithm terminates when a valid solution is found, which occurs when each grid contains exactly two '1's that satisfy all Sudoku constraints. * Why at Least One Invalid '1' is Guaranteed: * Pigeonhole Principle: Each grid has 9 cells (pigeonholes) but can only accommodate two '1's (pigeons). If we attempt to place a '1' in every cell of a grid, we violate the "two '1's per grid" rule. By the Pigeonhole Principle, at least one cell must then contain an invalid '1'. * Sudoku Constraints: A solvable Sudoku puzzle has a unique solution with strict constraints on where each number can be placed. Testing all possible '1's in a grid forces violations of these constraints, leading to the detection of invalid placements. * Complexity Analysis: * Constant Grid Size: Each grid has a constant size (9 cells). * Guaranteed Invalid Placement: In each iteration, at least one invalid '1' placement is guaranteed to be found. * Limited Iterations: The total number of iterations is limited by the total number of possible '1' placements across all grids (45 grids * 9 cells/grid = 405). This upper bound ensures the algorithm doesn't run indefinitely. * Polynomial Time per Iteration: Each iteration involves: * Constructing a 2-SAT instance (polynomial time). * Running the 2-SAT solver (polynomial time). * Marking the invalid placement and propagating constraints (constant time). * Overall Complexity: * The number of iterations is bounded by a constant (405), and each iteration takes polynomial time. Therefore, the overall complexity of the algorithm is polynomial. Conclusion: The proposed Sudoku solving algorithm, by leveraging the limited capacity of each grid in the encoding and the power of the 2-SAT solver to systematically identify and eliminate invalid '1' placements, guarantees finding the solution in polynomial time. This result offers a new perspective on the solvability of Sudoku and potentially has broader implications for tackling other constraint satisfaction problems.