Explain quick sort?
- 1 Answers
- 1048 Views
- I also Faced
- E-Mail Answers
Answer / Sachin Kumar Mourya
Quick Sort is a divide-and-conquer algorithm used for sorting. It works by selecting a pivot element and partitioning the remaining elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is meant by a dynamic array?
What do you mean by disjoint set adt?
Is it necessary to sort a file before searching a particular item ?
What does abstract data type means?
23 Answers College School Exams Tests, Infosys, SBIT, TCS,
What is priority queue in data structure?
What is a graph?
Explain the most efficient method to reverse a linked list?
Explain binary searching, Fibonacci search.
What is an ordered list?
What is sorting and its types?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
What is the need for extendible hashing?
Windows 
