SIGN IN SIGN UP

Create merge_sort_fastest.py

Python implementation of merge sort algorithm.
Takes an average of 0.6 microseconds to sort a list of length 1000 items.
Best Case Scenario : O(n)
Worst Case Scenario : O(n)
S
Syed Haseeb Shah committed
237df47a31240ebf35a5de304bcc6c73e8f921b9
Parent: 099caeb
Committed by GitHub <noreply@github.com> on 5/20/2018, 6:00:17 PM