2.8.1 QuickSort Algorithm

Video quality	The size	Download

Информация о 2.8.1 QuickSort Algorithm

Название	:	2.8.1 QuickSort Algorithm
Продолжительность	:	13.43
Дата публикации	:
Просмотров	:	2,6 jt

Such a great teacher in my life one day I will be meet u sir 🙏🙏
Comment from : GULABCHAND GUPTA

sir can you please explain the quicksort iteratively
Comment from : Dimpal Gogoi

Prompt and excellent explanation One of the best teachers on YouTube
Comment from : pranavi 432

wow made it easy for me thanks
Comment from : Hiba Khan

Nice
Comment from : ProHusband

Thank you very much sir❤
Comment from : Movie Clips

I like when he stops and stares deeply into my eyes until I understand
Comment from : David Morton

this is the best video for quick sort Thank you
Comment from : AI Matters

Simple and easy to digest explanation
Comment from : Muhammad Hassaan Basil

Sir it took me 3 months to understand this sorting technique But now that I found this video! I clearly understood every pin to pin detail of how it works Thank you so much for making it so easy sir🎉
Comment from : Aisha Shaik

It's really concise and understandable Thanks a lot
Comment from : Md Nahidul Alam Chowdhury

Do we nnecessary need to have a infinity value?
Comment from : Vũ Tuấn

😍😍😍
Comment from : Deeksha Bhat

in do while loop don't we need to check for bounday as well? exact algorithm gave me out of index exception with [10, 3]
Comment from : Do not Ask me my name

Thank you very much sir! I always dreaded quicksort from the name of it, but you explained it so beautifully!
Comment from : Jinendra Jain

Thanks sir because of you I’ve cleaned my DAA exam
Comment from : Tarun Reddy

U made this algorithm quick to understand❤
Comment from : Creative Arts

Thank you from Algeria 🇩🇿
Comment from : Abdo pianex

fucking genius
Comment from : Kaustubh Ramteke

sir you made it look so simple ! i can say its the simplest explanation i have surfed for in youtube for quick sort THANKSS
Comment from : Ritesh

Legend
Comment from : Tau Ceti

Abdul Bari sir is a living legend of DSA
Comment from : Amio Malakar

Can you make videos for design and analysis of algorithm?
Comment from : Tutor University

bless this individual
Comment from : george of the jungle

😢 Abdul Bari That's a clear explanation I am trying to under that speration part for 4 hours You nailed it in 13 min
Comment from : Saravana sai

Thank You Sir 😊
Comment from : Aysha Sherin M S

Ye toh Abdul Bari hai, ye toh accha bacha hai, ye algorithm padhta hai, acchi baatein batata hai🤲
Comment from : Sahil Khan

thank you sir
Comment from : VN Filmography

I think at 10: 15, you are writing the incorrect condition I think it should be A[i] > pivot and A[j] < pivot Correct me if I am wrong but this could just be a typo Thoughts?
Comment from : syedhussain

Thank you sir very much sir ❤
Comment from : Esther ch rani

excellent explanation
Comment from : zarmeza1

we all came here after our lecture on sorting algorithms lets be real here
Comment from : Sulkin

This is an Amazing Video
Comment from : Oryema Brian

his psuedo code he mixed up i and j or am i reading it wrong
Comment from : Sean L

I was looking for this algorithm for 2 days, and finally today I get what I was actually looking for thank you 😍
Comment from : Butt G

💙
Comment from : sozib rayhan

This person is legendary Explaining quick sort in just 13 minutes is not a joke yet explain it so easily Huge respect for you Sir
Comment from : LivingBeing

Abdul Bari the Goat of DSA 🐐❤
Comment from : AS IF

The quick sort code is not workingbrbrDoes any one tried? Please reply if you got the correct code
Comment from : Testing Account

How the name comes pivot? And can I code using a pivot as k?
Comment from : Cinephiles perspective

Great explanation sir quick sort got crystal clear
Comment from : Raghu Nadh

Sir you are a geniusJust amazing teaching
Comment from : 130_SHUBHRANIL MALLICK

Although visualization is better to understand, but in this video it shows that words pronounced with proper pace gives you more understanding than that if visualization Great
Comment from : Eldar Mammadov

Excellent teaching
Comment from : Pasham Sahithi Reddy

You are a great blessing for students sir !!!!! Thanks a lottttt ❤
Comment from : Avanthikha

Aoo sikhe Abdul Bari ke sang
Comment from : Sayed Taqui

🔥🔥🔥🔥🔥
Comment from : Jr_jeet

Can someone test this case ? (3,2,10,5,8,4,7) It does not work for me because when it 2 3 10 5 8 4 7, the index i just keep increasing (5 8 4 7 all < 10) and it become an infinity loop
Comment from : Minh Hoàng Công

Love you sir
Comment from : Programming Make Sense

It is good!
Comment from : Ayesha Naveed

6:39
Comment from : MePossible

THANK YOU you explained it perfectly in 13 min
Comment from : Ketara

Thank you sir You saved my life
Comment from : Hello_____

wow sir you are such a talented teacher im blown away
Comment from : Clorox Bleach

The example at the beggining was BOMB
Comment from : Pranay Kanisetty

never thought that I would learn quick sort in 10 min, need to make my hands dirty now and master this quick sort with some programming languages and some variations
Comment from : GUNA SEKAR TJ

I am curious, Is he teaching the DSA in java or another language?
Comment from : Anurag Shrestha

I know that my ex will always come here because she is studying algo now I just wanna say, I miss you and I love you to the moon and back I really do Keep it up with your studies ok? ❤
Comment from : kyokibot

Thank you Abdul!
Comment from : Halcyon Farr

Lucidly explained Suggestion: Please use differently coloured markers - makes the explanations more visually easy to grasp
Comment from : Viswanathan Suresh

My teachers should be fired lol
Comment from : Tala Yoki

There is 1 mistake
Comment from : tanjiro kamado

I like the video I was suffering a lot today
Comment from : David Deng wol

Just to point out this code does not work If you take [4, 4] you will find that you will get an index out of range error
Comment from : Dev01

Man, you're actually imparting a difference by Making learning fun
Comment from : Prakash R

Thanks Teacher I am super sorting now
Comment from : Tran Dinh Thien Tan (K17 HCM)

Hats off sir
Comment from : The guy who comments

a great video
Comment from : Ahmed Shindy

SIR URE THE BEST
Comment from : ChanChanChan

This is amazing, very clear instructional teaching Thank you for this lecture video
Comment from : Chris Cheng

Why my faculty can not explain topic like you !!! Just wasted 1 hour and 20 minutes in every monday and wednesday at uni !!
Comment from : Arham Ahmed Jobayer