Which of the following generally gives the worst performance?
A) Selection sort
B) Bubble sort
C) Insertion sort
D) Shell sort

Question

Quizplus · Accepted Answer

Bubble sort generally gives the worst performance among the options listed due to its average and worst-case time complexity of O(n^2), where n is the number of items being sorted. It repeatedly swaps adjacent elements if they are in the wrong order, which is highly inefficient for large datasets compared to the more sophisticated algorithm like Shell sort, or even the simpler insertion and selection sorts which can perform better under certain conditions.

Which of the Following Generally Gives the Worst Performance