© 2026 Hashnode
Hey, it’s me again. For my CSC 551 (Algorithm Design) assignment, I had to study the merge operation in merge sort the( O(n) part ), review a few implementations, and then create my own version. I ended up studying three different sorting algorithms,...

1. Sorting an array of strings Use CaseBehavior list.sort()Sorts array in-place (modifies original array, case-sensitive) [...list].sort()Sorts a shallow copy of the array (original remains unchanged) list.sort((a,b)=>a.localeCompare(b))Case...
