Tag: merge_sort
Sort an Array - Merge Sort Bottom Up approach 2nd attempt
Date: 2/5/2024Tags:algorithmsleetcodemerge_sortThis journal entry explains the condition for ending the inner for loop in a merge sort algorithm, which is `lo <= nums.length - size`, in order to ensure that at least one array is always available to merge.
Merge Sort with Bottom Up approach #2nd attempt
Date: 1/30/2024Tags:algorithmsleetcodemerge_sortThe journal entry is about a second attempt at implementing the Merge Sort algorithm with a bottom-up approach, explained in both text and a code snippet.
Merge sort with Bottom Up approach
Date: 1/29/2024Tags:algorithmsleetcodemerge_sortThe journal entry explores the implementation of merge sort using a Bottom Up approach through a code snippet.
Merge Sort #2nd attempt
Date: 1/29/2024Tags:algorithmsleetcodemerge_sortThe journal entry discusses the author's second attempt at using merge sort to solve the Sort an Array problem, highlighting lessons learned and providing code for the sorting algorithm implementation.
Merge Sort
Date: 1/28/2024Tags:algorithmsleetcodemerge_sortThis journal entry explains the merge sort algorithm and provides a code example of a function called `sortArray` that uses merge sort to sort an array of numbers.