***credit -> geekforgeeks -> https://www.geeksforgeeks.org/bubble-sort/
The idea is to place the largest element at their position and keep doing the same for every other elements.
Approach:
Place the largest element at their position, this operation makes sure that first largest element will be placed at the end of array. Recursively call for rest n – 1 elements with same operation and placing the next greater element at their position. Base condition for this recursion call would be, when number of elements in the array becomes 0 or 1 then, simply return (as they are already sorted).