1. Bubble Sort key Idea Compare adjacent pairs of elements in an array and swap them if they are in the wrong order, gradually moving larger elements to the end of the array. Time Complexity O(n^2) in the worst and average cases O(n) in the best ...