Project Description: This is an implementation of the Bubble Sort algorithm in Python. Bubble Sort works by iterating through every element in an array except for the last element and for each iteration, iterating through a reduced subarray depending on the main iteration, comparing the current element with the next element to see if it is either greater or less than it (and making a swap if needed to ultimately arrive at a sorted array). Due to the use of a nested for loop, the time complexity for this algorithm is O(n^2), and there are far more efficient alternatives, though this is a good algorithm to start with for beginners to DSA.
Click Here To View Code