Bubble sort algorithm
Elucidate the bubble sort algorithm?
Expert
Bubble sort algorithm is employed for sorting a list. It makes use of temporary variable for swapping. It compares two numbers at time and swaps them if they are in wrong order. This procedure is repeated till no swapping is required. The algorithm is extremely inefficient if the list is long.
E.g. List: - 7 4 5 3
1. 7 and 4 are compared
2. Since 4 < 7, 4 is stored in a temporary variable.
3. The content of 7 is now stored in the variable which was holding 4
4. Now, the content of temporary variable and the variable previously holding 7 swapped.
Write down the differentiation between a stack and a Queue?
Explain binary tree in brief.
Elucidate the three applications in that stacks are employed?
comparison between singly linked lists and doubly linked lists
What is Black box testing?
Write about queue?
What do you mean by priority queues? Describe.
Describe the term two-dimensional array by using example?
Describe in brief the term binary search?
Give a brief description of the term Merge Sort?
18,76,764
1954058 Asked
3,689
Active Tutors
1454375
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!