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.
Explain about the Huffman algorithm.
Define cohension and coupling?
How is different type of element insert in a stack? Is it possible?
Explain the difference between a stack and a Queue.
What is Bubble Sort?
Define when we should use plain list.
Explain the uses of Linked list.
Write down the difference between BFS and DFS?
Explain the Merge Sorting.
Explain binary tree in brief.
18,76,764
1930361 Asked
3,689
Active Tutors
1453029
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!