2 commits

Author	SHA1	Message	Date
William Carroll	a0e9e2b310	Solve unsorted-substring a second time ... This solution operates in O(n) time instead of O(n*log(n)) time, which surprisingly isn't *that* big of a difference... Consider a size of n of 10M... 1) ~10s 2) ~0.5s So, yes, the O(n*log(n)) will take 100x longer to complete, but for an enormous input size of 10M elements, it can still complete in under a minute. The difference between that and the second, faster, algorithm, is just 9s.	2020-11-14 15:28:23 +00:00
William Carroll	48fde5f278	Solve unsorted-substring ... Write a function that returns the indices demarcating a substring, which if sorted, would make the entire array sorted.	2020-11-14 15:08:25 +00:00