Delphi code O(x) complexity

Asked Jan 30 '17 at 14:08

Active Jan 30 '17 at 14:13

Viewed 75 times

I have found a Delphi source code from the net that I am going to use but I see that there are comments like procedure sortList; // sorry for O(n^2) but a log(n) is impossible. gl. Not going to post the code here, but it sorts stuff in a TList with some for loops.

I have read Marco Cantu and Nick Hodges books but I have never seen the O(x) thing. I have googled it and I have seen that indicates how much a procedure is fast. Is it correct?

Does delphi support this feature as well? Sorry but I have seen a lot of maths and I haven't understood very well.

edited Jan 30 '17 at 14:13

J...

30,968
6
66
143

asked Jan 30 '17 at 14:08

Raffaele Rossi

2,997
4
31
62

Have you seen https://en.wikipedia.org/wiki/Big_O_notation? – MartynA Jan 30 '17 at 14:10
And FWIW, O(N^2) for sorting is probably indicative of a poor algorithm choice. – David Heffernan Jan 30 '17 at 14:33
O(Logn) impossible... Indeed, that's only possible for *some* algorithm on an already sorted list. O(n^2) the best possible? I seriously doubt it. – Ken Bourassa Jan 30 '17 at 14:37
I predict something like insertion sort with 3k entries... – Alberto Miola Jan 30 '17 at 15:18

Delphi code O(x) complexity

0 Answers0