RE: My job hunt progress - EC2! 03-04-2018, 01:13 AM
#12
Good luck! Seems like a nice job.
The first solution I thought of would have a really odd computational and memory complexity, reduced if there are no duplicate numbers. However, it would vary based on the size of the largest number in the array, so there is no guarantee to be above or below O(nlogn). (based on bucket sort, my favorite sorting algorithm) Later thoughts were less weird.
The first solution I thought of would have a really odd computational and memory complexity, reduced if there are no duplicate numbers. However, it would vary based on the size of the largest number in the array, so there is no guarantee to be above or below O(nlogn). (based on bucket sort, my favorite sorting algorithm) Later thoughts were less weird.
![[+]](https://sinister.ly/images/modern/collapse_collapsed.png)
