What is quick sort, Data Structure & Algorithms

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







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
Related Questions
Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Run time complexity of an algorithm is depend on

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 (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Ask question #explain it beriflyMinimum 100 words accepted#

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

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,

Ask quapplication of data structure estion #Minimum 100 words accepted#

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

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