What is quick sort?  

Answer

Quick sort is one of the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are divided or portioned such that elements less than pivot point are in left and those greater than pivot are on the right. Now, elements on the left and right can be recursively sorted by repeating algorithm.

 

Posted Date: 9/9/2013 2:27:47 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

Implementation of tree, The most common way to insert nodes to a general tr... The most common way to insert nodes to a general tree is to first discover the desired parent of the node you desire to insert, and then insert the node to the parent's child list.

Define rule-based expert system, 1. Define the following terms in a rule-ba... 1. Define the following terms in a rule-based expert system? a) Knowledge base b) Inference engine 2. What is a fuzzy rule? Explain the difference between classical and fuzzy

Conversion of general trees to binary trees, Taking a suitable example expl... Taking a suitable example explains how a general tree can be shown as a Binary Tree. Conversion of general trees to binary trees: A general tree can be changed into an equiv

Internal sorting, In internal sorting, all of the data to be sorted is obta... In internal sorting, all of the data to be sorted is obtainable in the high speed main memory of the computer. We will learn the methods of internal sorting which are following:

Graph traversal schemes, Q. Explain various graph traversal schemes and wri... Q. Explain various graph traversal schemes and write their advantages and disadvantages. A n s . Graph Traversal Scheme is explained below In many troubles we wish

Program segment for insertion of an element into the queue, Program: Progra... Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Determine the class invariants- ruby, Determine the class invariants- Ruby ... Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Total impedent of the circuit, an electrical student designed a circuit in... an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

EM13845162, Do you have a library solution for this problem? Do you have a library solution for this problem?

Stack making use of the linked list, Q. Implement a stack making use of the... Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include