This course explores the bottom-up version of MergeSort, an efficient non-recursive sorting algorithm. Students will learn how the algorithm processes the array in successive passes, doubling the size of sorted sub-arrays in each iteration, and merging them together until the entire array is sorted. The course covers the basic principles, the implementation details, and the performance characteristics of bottom-up MergeSort, including its time complexity and space usage.