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

Hacker Newsnew | past | comments | ask | show | jobs | submit

		segmondy on June 11, 2019 \| parent \| context \| favorite \| on: Solving Sudoku with Prolog (2016) All computer science problems can be reduced to sorting & searching. ;-D

randomsearch on June 11, 2019 [–]

Is this really true? I was wondering about complexity analysis, for example.

ggggtez on June 12, 2019 | | [–]

No it's not true. I think if you called multiplication a sorting algorithm it would be really dishonest.

iamgopal on June 11, 2019 | | [–]

Search to sort, sort to search, don't use random search.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact