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
- intellij-idea
- java
- leetcode
Java Code to sort a list. Here I am taking LinkedList
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
Leave feedback in the comments!
Log in or sign up for Devpost to join the conversation.