What it does

find mid using finding mid of list using fast and slow pointer and divide list in left and right then sort both and merge them using method merging two lists

Built With

Share this project:

Updates