Quick Sort in Tamil | Best explanation with Animation and Pseudo code

Quick sort in Tamil, Data structures and Algorithm. In this video We are explaining quick sort algorithm in Tamil using animation. And also coding with animation which will be very easy to understand even for beginners. Students can refer this for their daa exam. Not specific to any programming language, covered java and python. Time complexity of quick sort algorithm in different cases are explained clearly. Best case: O(nLogn) Average case: O(nLogn) Worst case: O (n^2) (If the list is already sorted in ascending or descending order) In Quick Sort data structures in Tamil explanation We have used pivot as a first element in the unsorted array to sort it in ascending order. We can also achieve this by choosing pivot as last element or random element in the list. Quick sort algorithm is faster than merge sort algorithm. 00:00 Intro 00:32 Concept Quick sort github code: https://gist.github.com/pradeeshtet/9... -------------------------------------------- To get in touch: -------------------------------------------- Futens official Insta:   / weare_futens   FB:   / futens   Follow me :   / pradeeshtet    #QuickSort #withAnimation