Python Tutorials - Quick Sort Algorithm | Program | Part-1

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...
Quick sort algorithm and example:
• Python Tutorials - Qui...
• Python Tutorials - Qui...
Swapping Program:
• Python Tutorial - Prog...
#PythonProgramming #SortingAlgorithm #QuickSort
For more free tutorials on computer programming
/ amulsacademy
/ amulsacademy

[@nithunraj7752]

Usually I don't spare time for comments. But I can't really go back without appreciating you for this explanation and easy code. Thank you!!

[@hit_420]

Appreciation from my side. When I have any doubt, I come to see your videos to clear those..

[@nilimathorat4540]

❤❤❤❤ Nice explanation and for your hard work.

[@slater-cguy]

The best DSA lectures on youtube, thank you, @AmulsAcademy !

[@srikanthboora2525]

Mam ur way of speech is very good,with clear voice nd explaination

[@masoom5320]

wasted whole day t learn but at the end I learned here

[@AmulsAcademy]

Thank you :)

[@rajeshjain1204]

Is your code running without any error ????

[@anshulvairagade1604]

Mam, you are a superwoman, you teaches so nicely, thanks for the hard work you are doing for us.

[@hereweare644]

I can't find a teacher like you

[@balakrishnavaidyanathan8572]

Great quick sort.you can do ascending or descending order.great video

[@AmulsAcademy]

Thank you :)

[@narora8459]

Great explanation fantastic...😇😇😘😘

[@AmulsAcademy]

Thank you 😊

[@maqsoodalammansoori6189]

Traceback (most recent call last):
File "M:/Python/QuickSortTest.py", line 25, in
Quicksort(list1,0,n-1)
File "M:/Python/QuickSortTest.py", line 20, in Quicksort
Quicksort(list1,first,p-1)
TypeError: unsupported operand type(s) for -: 'NoneType' and 'int'
> error is coming.

[@AmulsAcademy]

def pivot_place(list1,first,last):
pivot=list1[first]
left=first+1
right=last
while True:
while left

[@narsimhareddy4742]

@@AmulsAcademy even I am getting Sam error mam

[@HarshSharma-ow2pe]

@@AmulsAcademy error geetting in this code please gave another example for this.

[@HarshSharma-ow2pe]

hi bro ,if you have clear this error then please tell me how

[@HarshSharma-ow2pe]

​@@AmulsAcademytell me mam

[@shreyabag64]

it is a great tutorial.thank you so much for this

[@shubhamdudhe673]

I always got confused how quick sort work but after seen ur vedio i did understand in better way, thank u so much mam for ur deeply explanation ❤

[@AmulsAcademy]

Most welcome 😊

[@SachinYadav-qe3gb]

Thanks, I saw lots of video but only here I understand. Once again thanks

[@shivamingle2157]

Mam, very very very very thank u.
Amazing Explanation Thank u.

[@AmulsAcademy]

Most welcome 😊

[@sabujosephvld]

Mam how can I sort integers in a queue in descending order without using built functions

[@slc388]

same program i written in visual studio code but complier gives some mistakes but i follow proper indiation why it shows it shows like that so ple give me reply

[@shanmugarajs4309]

Explain clearly ,thanks

[@sivasurya4149]

Madam after swap the pivot position to right position .so right position is pivot.. right...after div the list again do same process but in the program no repeated the process..

[@naiduadhikari1014]

it is raising index out of range when we give input [5,4,3,2,1]..once check

[@AmulsAcademy]

Give me the program I will check :)

[@naiduadhikari1014]

@@AmulsAcademy please check with ex 5,4,3,2,1 I'm getting index out of range

[@chhusnain9773]

how sublists are sorted recursively i dont understand that when you writye quick sort function can you please explain me

[@AmulsAcademy]

Take one example and trace the program 😊

[@shreyasipaul7767]

U r the bEst❤️

[@AmulsAcademy]

Thank you :)

[@kireetikesani9422]

Hello,Mam when u will statt data structures in python??,we are waiting for that

[@verryberrypie]

amazing tutorial. Do you think you could do a tutorial on quick select?

[@AmulsAcademy]

Thank you :)
I will try :)

[@432aniketkadam4]

Please make video on krushkal Minimum spanning tree

[@Shivam_Manswalia]

Thankyou You are amazing.

[@AmulsAcademy]

Glad to hear that :)

[@Shivam_Manswalia]

@@AmulsAcademy hey I need help can you please suggest me topics that I must learn to get a job pleeeease.

[@AmulsAcademy]

Be clear with at least one language and also few programs like prime numbers pattern programs...

[@phaneendragajawada6476]

hi madam, how can we know when to use function and when not to use function???because in previous sel sork and quick sort we didnt use function and here u are using function so plz expalin that

[@AmulsAcademy]

If the part of code need to be executed again and again you need to use functions :)
In other cases if you want you can use functions :)

[@saitarun6562]

iam noticed that you said 14:21 right

[@sridharraj1398]

She is checking index value not the list value that is 5

[@ramyad5362]

thank you mam☺

[@faheemashraf6051]

Thank You>>>>>>>>>>>>>>>>>>>>>>

[@AmulsAcademy]

My Pleasure :)

[@muktesh_gautam]

Thanks Mam, I really like your teaching style! : )

[@AmulsAcademy]

Thank you :)

[@surajagasti2309]

cant we use for loop for execution

[@AmulsAcademy]

Yes :)

[@nachiappanrm1915]

Mam, i am a cse student. i had python mini project in this semester! I don't have any idea abt that can u suggest me a best topic that seems to be the best one in our class ,mam?

[@rahulsanapathi2305]

why did you use while true what is the meaning

[@Nothingtosaymore]

Same doubt

[@Indian-fh8hf]

please make a video on "LINKED LIST "

[@AmulsAcademy]

Sure :)

[@debojitmandal8670]

But y list1 [ first ] and not list 1[pivot] where as you were able to take list 1[ right] but not pivot y.
Also in the recursive case why can't we use if condition i.e if list1> 1. As the base condition

[@najeebhafeel5180]

Madam It is very useful if u post hackerrank solutions

[@AmulsAcademy]

I will try :)

[@harsimrankaur9845]

Ma'am , What's the time complexity of pivot_place function?

[@nandalal133]

O(logN)

[@rajeshjain1204]

Easy explanation but it's showing a error TypeError unsupported operand type(s) for 'NoneType' and 'int'

[@adityaranjanbehera7963]

Can you help me mam, why this swapping method is not working ?

[@AmulsAcademy]

Give me the program i will check :)

[@sripoojithak6327]

Getting error as unsupported operand type for -: ' NoneType' and 'int'

[@rinkeedebnath]

I'm also getting this same error...if you know the solution please let me know

[@rajeshjain1204]

Same here

[@krishnavamsinadharikatla5150]

Thank you very much mam

[@AmulsAcademy]

Welcome:)

[@smileplz1334]

Mam, how to replace Input with Replace Module

[@AmulsAcademy]

list1 = []
list1 = [eval(input(":")) for i in range(5)]
print(list1)
list1[2] = "hello"
print(list1)
:)

[@smileplz1334]

@@AmulsAcademy
Print("Thanks ")

[@shafavp9894]

Please do linked List in python

[@rajkir2852]

What is p = pivot_place(list1,first,last) ?

[@payalsaha7444]

pivot_place function is returning the right index which is stored in p

[@_rupeshchauhan]

mam how to accept the list from user

[@AmulsAcademy]

You can use list comprehension method.
:)

[@bhagiyarajmahesh8972]

How python knows that the first = the 0th INDEX of the list and the last= last index of the list? we've given it as arguments.

[@kireetikesani9422]

Thnak U madam

[@AmulsAcademy]

My Pleasure :)

[@kgmohanachandran599]

It is totally complicating when compared to other similer vedios.

[@siddappagodi6068]

Mdm how to exicute program repeat

[@vigneshkumar5634]

def pivot_place(list1,first,last):
pivot=list1[first]
left=first+1
right=last
while True:
while left

[@AmulsAcademy]

while True:
while left

[@krishnavamsinadharikatla5150]

Please do program on tower of Hanoi mam

[@AmulsAcademy]

Sure:)

[@satyamsharma9920]

thanks SIR

[@AmulsAcademy]

Pleasure :)