Michael Sambol

Пікірлер

@LilliamMishra-i2r 14 сағат бұрын

Aidan Terrace

@LizzieMaureen-b9o 20 сағат бұрын

Schaden Drive

@MarkJones-v8y Күн бұрын

7202 Antoinette Mills

@TravisDekker-p3l Күн бұрын

Keyon Crossroad

@BelegaerTheGreat Күн бұрын

Yay. Nothing makes sense, we just shift things around, having to memorize dozens of strange cases, with no clue what is going on. I am not learning this shit.

@CockerMarshall-w8d 2 күн бұрын

Miller Landing

@RichardHerrera-g9t 2 күн бұрын

93371 Schmitt View

@BusterMayers 2 күн бұрын

Lewis Kevin Martinez Melissa Rodriguez Deborah

@the_eyepatch2579 3 күн бұрын

awsome!

@LaurieArnold-b6d 3 күн бұрын

Thompson Isle

@AbeTrista-x3p 3 күн бұрын

Jessy Shores

@BertOrman-w5m 3 күн бұрын

Predovic Overpass

@JohnTaylor-o1b 4 күн бұрын

Botsford Mount

@AnibalStromberg-o9r 4 күн бұрын

Scarlett Tunnel

@Tex1680 4 күн бұрын

Wait.... is this why the writer of The Big O anime named it like that?.... because this ideology follows the plot of the show. Keep resetting again and again until the most efficient reality is made?

@TurnerHowar-t2k 4 күн бұрын

Pacocha Mission

@Shay-mw1hh 4 күн бұрын

I don't get it. What if the pivot has no greater than or less than itself? What numbers can it compare to?

@arjunsharma2506 5 күн бұрын

Babul sort 😂😂

@YolandeKozera-q4v 5 күн бұрын

Schuppe Key

@EMMANUELROCHUS 5 күн бұрын

really helpful

@GkjcAmpj-s2g 5 күн бұрын

Alan Turnpike

@raashid_07 6 күн бұрын

My college professors should take tuition from you. Thankyou so much for these easy and short explanation videos

@brokenvectors 6 күн бұрын

I think this video would be more complete if there was an example for arrays of odd length.

@magickomchanell4556 6 күн бұрын

Very helpful thanks for the video!

@karthikeyaavasarala9778 7 күн бұрын

Love this!!!

@user-sp6xq9ll4r 7 күн бұрын

Bruh I thought it in 2 seconds

@BelegaerTheGreat 7 күн бұрын

2:20 I have to assume that in the case of this being actually just a 4-node tree, the top 3 nodes would be black and the bottom red.

@a6b59ghj51d 7 күн бұрын

It's a great visualization and explanation but using a language as slow as python to demonstrate DSA is jokeworthy, that was still true 8 years ago. Put down the keyboard pythonistas, nobody will get hurt!

@atmajoburman7335 9 күн бұрын

better and much easier algo than any standard quicksort algo available in the books

@benzene___ 10 күн бұрын

good for revision

@jasonleng2490 10 күн бұрын

Your channel deserves way more subscriptions.

@antonkomaristyy3562 10 күн бұрын

this is goated, deserves all the likes

@MichaelSambol 10 күн бұрын

Thanks man!

@SSuren-sx9yh 11 күн бұрын

2024❤

@MichaelSambol 10 күн бұрын

👊🏽

@okumuraash3727 11 күн бұрын

wt the fk did i miss, i dont understand shit, SHIT⚰

@hardiksatija2630 11 күн бұрын

here for iit madrass end term

@monjasonsteng7861 12 күн бұрын

Thank you!

@RoseWilson-u2t 12 күн бұрын

Lewis Shirley Thomas Laura Lee Mary

@amanasati5198 13 күн бұрын

I remember, I had watched the RB tree till insertion when I was at college and was just revising this topic. As the insertion example video ended, I thought it's the end. "But here we go again". Thanks 😂😂

@jovem3767 14 күн бұрын

if time complexity is the same, why choose dfs over bfs, or vice-versa?

@reefstarnes839 14 күн бұрын

0:50 Suck on deez nuts

@cg8770 14 күн бұрын

Nice video!! It helped me a lot

@ceasarmusk7088 15 күн бұрын

Holy shit visit left right actually makes so much sense

@monjasonsteng7861 15 күн бұрын

This was great. Thank you!

@newmb321 15 күн бұрын

my professor kept rambling and rambling until I was just like, "do you even know how this works?" he admitted he didn't so I told him to put on Michael Sambol. later, he thanked me after class and told me that he had spent years trying to figure this one out.