Hello everyone

Before I dive deep into the theory of sorting algorithms, I thought it would be a fun exercise to create my own algorithms and see how they compare to those I will learn about. The algorithm I have prepared today simply compares the one element to the adjacent to it, and if the first element is bigger it swaps them. It does this throughout the whole list n times, where n is the length of the list. This algorithm has a time complexity of O(n^2) for its best, average and worst cases. One way to improve the best and average case would be to check if the list is sorted at each step of the first for loop. However, this will make the worst-case scenario much worse. 

Thank you for reading. If you would like to see more of my work check out my GitHub.