Working process of Quick sort
Write down in brief the working process of Quick sort?
Expert
The working process of Quick sort is as shown below:
a) Choose an element, pivot from the list.
b) Rearrange the elements in list, so that all the elements those are less than the pivot are arranged before pivot and all the elements which are greater than the pivot are arranged after the pivot. Now the pivot is in its position.
c) Sort the both sub lists-sub list of the elements that are less than the pivot and the list of elements that are more than the pivot recursively.
Explain about the Huffman algorithm.
Write down in brief the working process of Merge Sort?
Describe the term iterative algorithm?
Write about queue?
Describe the process how to implement the queue by using stack.
Define the pre-order and in-order tree traversal.
What do you mean by Huffman algorithm?
Write down the demerits of circular linked list over linear linked list?
Describe the term binary tree? Describe its some uses.
What is the application of tree data-structure?
18,76,764
1940045 Asked
3,689
Active Tutors
1456259
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!