#interview
Read more stories on Hashnode
Articles with this tag
MergeSort splits an array into halves which takes log(n) time and then takes n operations to sort the entire list when we are merging it back after...
