3 ms·
Well, deciding whether an array of arbitrary data is sorted can be done trivially in O(n). Sorting an unsorted array requires a much more complicated algorithm
by wongarsu 9y ago
Well, deciding whether an array of arbitrary data is sorted can be done trivially in O(n). Sorting an unsorted array requires a much more complicated algorithm that runs in O(n log n) (or worse).
I imagine computers would be able to do quite well at judging a turing test heuristically. Passing it is quite a different matter.
- balls187 9y ago> Sorting an unsorted array requires a much more complicated algorithm That is taught in every CS algorithm course.
- wongarsu 9y agoYes, every CS course teaches you multiple algorithms for sorting data. Most of them require extensive explanation to understand, and are very hard to come up with on your own.