2 ms·
Finding something in a sorted list is O(log n) instead of O(n) in non-sorted. Finding a good representation for the problem matters.
by daralthus 4y ago
Finding something in a sorted list is O(log n) instead of O(n) in non-sorted. Finding a good representation for the problem matters.