Sdet Technical Lead Interview Questions and Answers

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

• Compare adjacent elements and swap if necessary

• Repeat until no more swaps are needed

• Time complexity: O(n^2)

• Space complexity: O(1)

• Example: ['3', '1', '4', '1', '5', '9', '2', '6', '5', '3']