Merge Sort is an efficient sorting algorithm that uses the "Divide and Conquer" approach. It divides a large array into smaller subarrays, sorts them recursively, and merges them back together. It has a time complexity of π ( π log β‘ π ) O(nlogn) in the worst case, making it suitable for large datasets.
-
Notifications
You must be signed in to change notification settings - Fork 0
Merge Sort is an efficient sorting algorithm that uses the "Divide and Conquer" approach. It divides a large array into smaller subarrays, sorts them recursively, and merges them back together. It has a time complexity of π ( π log β‘ π ) O(nlogn) in the worst case, making it suitable for large datasets.
tolgahanacar/mergeSort
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Β | Β | |||
Β | Β | |||
Repository files navigation
About
Merge Sort is an efficient sorting algorithm that uses the "Divide and Conquer" approach. It divides a large array into smaller subarrays, sorts them recursively, and merges them back together. It has a time complexity of π ( π log β‘ π ) O(nlogn) in the worst case, making it suitable for large datasets.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published