What is quick sort?

Quick sort is a sorting algorithm that uses the idea if split and conquer. This algorithm chooses an element called as pivot element; search its position in the array such that it splits the array into two sub arrays. The elements in the left sub array are less than and the elements in the right sub array are greater than the in-between element.

 

Posted Date: 5/10/2013 2:58:18 AM | Location : United States

Ask an Expert

Related Discussions:- What is quick sort, Assignment Help, Ask Question on What is quick sort, Get Answer, Expert's Help, What is quick sort Discussions

Write discussion on What is quick sort
Your posts are moderated

Write your message here..

Related Questions

Which are the two standard ways of traversing a graph, Which are the two st... Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Time complexity, Run time complexity of an algorithm is depend on Run time complexity of an algorithm is depend on

Array-based representation of a binary tree, Assume a complete binary tree ... Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n

Advantages of first in first out method, Advantages of First in First out (... Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Prime''z algorithem, Ask question #explain it beriflyMinimum 100 words acce... Ask question #explain it beriflyMinimum 100 words accepted#

Header linked list, creation,insertion,deletion of header linked list using... creation,insertion,deletion of header linked list using c.

Explain multidimensional array, Multidimensional array: Multidimensional a... Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,

#title., Ask quapplication of data structure estion #Minimum 100 words acce... Ask quapplication of data structure estion #Minimum 100 words accepted#

Define midsquare method, Midsquare Method :- this operates in 2 steps. In t... Midsquare Method :- this operates in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of

Sparse matrix, Q. Define a sparse matrix. Explain different types of sparse... Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk