Bubble Sort and Quick sort
Briefly describe the term Bubble Sort and Quick sort?
Expert
Bubble Sort : The easiest sorting algorithm. It involves the sorting the list in a repetitive fashion. It compares two adjacent elements in list, and swaps them if they are not in designated order. It continues till there are no swaps required. This is the signal for list that is sorted. It is also named as comparison sort as it employs comparisons.
Quick Sort : The most excellent sorting algorithm that implements the ‘divide and conquer’ concept. It first divides the list in two parts by picking the element a ’pivot’. It then arranges the elements those are smaller than pivot in one sub list and elements those are greater than pivot in one sub list by keeping pivot in its original place.
Explain about the priority queue?
What is the way to implement of deletion from a binary tree?
In a linked list how can I search for data?
Write down a brief note on the term Huffman algorithm?
Explain the user interface design?
Define the term threaded binary tree. Describe its common uses.
Write down the differentiation between STACK and ARRAY?
Give a brief description of the term Merge Sort?
How is the front of the queue computed?
18,76,764
1938133 Asked
3,689
Active Tutors
1441525
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!