Quick Sort Algorithm | Example | Part - 2/2 | DAA | Lec-18 | Bhanu Priya

preview_player
Показать описание
Design & Analysis of Algorithms ( DAA )
Quick sort algorithm with example
#designandanalysisofalgorithms #quicksort #sortingalgorithm #sorting #sortingalgorithms #computersciencecourses #engineering #computerscienceducation #engineeringvideos #educationalvideos #education #computerengineering

Class Notes ( pdf )

Complete Playlist : Design & Analysis of Algorithms ( DAA )

Complete playlist : DBMS

Complete Playlist : DATA STRUCTURES ( DS )

Complete playlist : ARTIFICIAL INTELLIGENCE ( AI )

Complete Playlist : OPERATING SYSTEM ( OS )

Complete Playlist : SOFTWARE ENGINEERING ( SE )

Complete Playlist : Theory of Computation ( TOC )

Complete Playlist : COA

Complete Playlist : C Programming

Complete Playlist : OOP's in C++

Complete Playlist : STLD

Complete Playlist : DISTRIBUTED SYSTEMS

Complete Playlist : Web Technology

Complete Playlist : CSS

Complete Playlist : Cloud computing

Complete Playlist : Computer Graphics
Рекомендации по теме
Комментарии
Автор

u didn't explained example properly

ankushsingh
Автор

Pivot element is mainly called as Central element or central point ..this vedio is good ..and very well explained.

kaurshine
Автор

Mam 🧿 I don't have any words to explain your teaching skills. ❤️

abhijitnayak.
Автор

Why we take pivot element ..
This is how we able to know that in the array the elements which r lesser than pivot (which we have considered as a central point) are taken to the left side or those which are greater are taken to the right place of pivot...so ..this is the exact teach well in above vedio... nothing is wrong.in this..vedio...

kaurshine
Автор

U didn't explain how to exchange pivot value

shrinivaskulkarni
Автор

well, where everyone is saying that the partition or exchanging the pivot was not explained properly, i don't know why but it's making me laugh(sorry) because normally if u r coming to a video for understanding a concept, either you know the basic concepts or you follow the previous videos regarding the basics of the concept(as also mentioned many times by the lecturer in this video that this thing is explained in the previous video), so stop complaining others when it's your fault to not come with preparation.. i mean you can't expect to learn color names in English when u can't recognize the English Alphabets..

i guess the video was great.

asmaattique
Автор

Refer her data structures lecture 60 and 61 for better understanding this concept.

parassharma
Автор

U didn't explain partition process

ridewithuday
Автор

ohho, I didnt get how she made the GREEEN Bracket !

VideoLanxer
Автор

Madam at starting u taken 2, 1 3, 4....how u taken madam plzz can you explain it?

anithakolavasi
Автор

How to handle duplicate keys while sorting ??

-mohitsingchaudhari
Автор

Hello mam thank u so much please solve my problem how to arrange 2 6 1 4 using quick sort algorithm if anyone knows how to arrange please send me the solution with example

NishaSharma-nddk
Автор

Just stop commenting bad, atleast she has an idea about the concept what is teaching. We people don't even have a minimum knowledge about quick

meghamalapathikala
Автор

You have not explained example in previous video

ekanadhreddy
Автор

Mam I didn't understand properly mam.. 😭

charithacharan
Автор

This example I doesn't understand.

tirumalatirumalarao
Автор

Dekh dekh k likhna nh hota smjhana bh hota h

abhimanyusingh