Python Tutorials - Quick Sort | Example | Introduction | Last Element As Pivot

In this Python programming video tutorial we will learn about how to sort the number using quick sort algorithm in detail.
Quicksort algorithm is also called as "partition exchange sort" algorithm it is developed by Tony Hoare in 1959 and published in 1961 so it is one of the commonly used sorting algorithm.
Quicksort algorithm when implemented well it can be about 2 or 3 times faster than the merge sort and heapsort. I guess that's why the name Quicksort.
Quick sort is the comparison sort algorithm so here also we will compare the values, to rearrange the list we will compare the values.
It is in_place algorithm so that is nothing but it may require small additional amount of memory to perform the sorting but it is the in place sorting.
And It is unstable algorithm that is nothing but the relative order of equal sort item is not preserved like, if you are sorting a list and it contains the duplicate values the order they will appear in the input may not be the same in the output.
Selection Sort Algorithm And Program:
• Python Tutorials - Sel...
• Python Tutorials - Sel...
• Python Tutorials - Sel...
• Python Tutorials - Sel...
Bubble Sort Algorithm and program:
• Python Tutorials - Bub...
• Python Tutorials - Bub...
#PythonProgramming #SortingAlgorithm #QuickSort
For more free tutorials on computer programming
/ amulsacademy
/ amulsacademy

[@tirathdewangan9773]

This is the best explanation I have came acorss for quick sort ,crisp clear with keypoints for handling same locations of pivot and pointers giving all details like disadvantage of selecting first and last for sorted and reverse sequence

[@kmnm9463]

Hi M'am, This is excellent tutorial on quick sort. Your presentation of concepts is very clear and precise. Your voice is also crystal clear in its diction. The timestamp 16:07 at which you say - '17' is sorted' makes the whole sorting algorithm very clear. This is sheer brilliance. I have subscribed. Thanks.

[@noorhassanwazir8133]

Superb teaching mam saheba.Respect and love from pakistan

[@AmulsAcademy]

Thank you :)

[@tbc6583]

Literally I have exams on tomorrow .I was searching for a proper explanation and finally I got it.Thanks alot 😀

[@sivasrimakurthi206]

@amulyasAcademy -- super, super, SUPER!! your mind works like a computer, methodical and clear instructions and steps... I learnt a good deal of subject with this lesson!! Thanks !!

[@sushilkumar-ef7gh]

thanks for this video ,I was waiting for that video for a long time.

[@AmulsAcademy]

Sorry for the delay:)

[@debojitmandal8670]

@@AmulsAcademy mam why can't I use bubble sort or other sort bcs quick sort is extremely complicated .

[@rexxter5718]

ThankYou

[@kanchidoshi6907]

Can you please explain why for last element as pivot, we need to swap pivot with left?

[@hereweare644]

I can't thank you enough

[@rationalthinker3706]

hey... brp please complete the playlist of algorithm

[@pardevelo5654]

mam ur voice is just killing us ,pls make a video with your face 😊,it will be better to understand for students with face expression🔥

[@shaikansarbasha4169]

MAM,How recursion works in tower of Hanoi problem.Please explain

[@AmulsAcademy]

Will make a video :)

[@johnysins5338]

If we already have inbuilt function sorted () in Python then why we are doing this complex algorithms??

[@parthasarathimohapatra7102]

In CP you can't apply in all problem inbuilt function. And from another perspective of the interview also.

[@ashoksaipudi6999]

Bcoz of everything matters for time complexity and the way of logic you are applying to do the problem

[@naveenadhikari5953]

Plzz mam make a video on binary search in python

[@AmulsAcademy]

Sure:)

[@mr.a1976]

Mam, how we will write code (quick code ) in Python. & Thankuu

[@AmulsAcademy]

firstly you need to understand the concepts(problems) well. Clear basic programming knowledge. Some practice. :)

[@mr.a1976]

@@AmulsAcademy Mam your voice is very smooth & thankuu mam for time to time uploaded Python progrmming videos . OK mam , practice makes Bette to best.

[@AmulsAcademy]

:)

[@bhavyaaggarwal8558]

ma'am plz make video on tim sort also

[@AmulsAcademy]

I will try :)

[@bhavyaaggarwal8558]

@@AmulsAcademy thanks ma'am

[@Adarsh-qy5hi]

Hi, can u tell me what is the time complexity for the code that u have written using this logic?

[@lordshiv9290]

she didn't write the code in this video 😒

[@sajjadshiekh8410]

my python code is not running

[@satishsr7665]

may i expect django from u

[@shwetajaiswal777]

mam, why we need quick sort ?

[@AmulsAcademy]

It is one of the best sorting algorithm when we are dealing with huge nUmber of items :)

[@CentboyMidnight]

shorter format pls

[@prajwalkumarsaw]

it is highly recommended to equalize your voice pitch... it hitting in our head..... otherwise, It's fine.

[@chethanb6406]

your teaching is great but could you pick up the pace a bit, we are not nine-year-olds, I am watching your videos on 2x,other than that everything is great,keep it up.