Kevin Naughton Jr.
Results
3
comments of
Kevin Naughton Jr.
This assumes that the array is sorted which is not the case. Therefore this adds an overhead of O(nlogn) to sort which is slower than O(n)
Seeing some merge conflicts...hmmm
Any luck with this or should I close this PR?