hacktoberfest-2022
hacktoberfest-2022 copied to clipboard
How is a merge sort algorithm implemented?
How is a merge sort algorithm implemented?
merge sort algorithm works on divide and conquer approach in which first the array is divided into subarrays and and then sorted one after another . can I provide the code for it in python @mohitmishra786 ???
@ArSin2002 yes