The best thing about a boolean is even if you are wrong, you are only off by a bit. Anonymous

Quick sort

Language Java | Level Intermediate | Category Algorithms | August 2, 2015 8:50 pm


Algorithm Problem Description

Quicksort is an efficient comparison sort algorithm. It can operate in place on the array, requiring small additional amounts of memory to perform sorting.

Quicksort can be faster than merge sort and heap sort. Quicksort is one of the divides and conquers strategy algorithm. It requires careful selection of pivot element. Even if the array nearly sorted or sorted the quicksort takes the same complexity. If the array nearly sorted, we can choose insertion sort for better complexity.

Write a program to implement the quick sort.

Output

          	        
          	        

Unsorted array before sorting: [12, 34, 56, 23, 45, 78, 46]
Sorted array After Quicksort sorting: [12, 23, 34, 45, 46, 56, 78]


          	        
          	        				    


Comments



Please login to add comments.