4 ms·

All computer science problems can be reduced to sorting & searching. ;-D

• randomsearch 7y ago
  Is this really true? I was wondering about complexity analysis, for example.
  • iamgopal 7y ago
    Search to sort, sort to search, don't use random search.
  • ggggtez 7y ago
    No it's not true. I think if you called multiplication a sorting algorithm it would be really dishonest.