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
Explain the Memory Function method The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  su

Let G=(V,E) be a graph for which all nodes have degree 5 and where G is 5-edge is connected. a) Show that the vector x which is indexed by the edges E and for which xe = 1/5 for

Q. Explain the various memory allocation strategies.                                                            Ans. M e m ory Allocation Strategies are given as follow


Explain the array and linked list implementation of stack

In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore

Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?

how we will make projects on stack in c?