This course introduces the bottom-up version of MergeSort, a non-recursive approach to sorting arrays. Students will learn the iterative process of merging sub-arrays of increasing sizes to achieve a fully sorted array. The course covers the basic algorithm, coding implementation, and performance analysis, including space complexity and the number of passes required for sorting.