O(n) sorting!
Moderator: Dust
- Dust
- The Boss
- Posts: 9093
- Joined: 01 Jan 1970 01:00
- Contact:
O(n) sorting!
I do what I think is right. But I don't think that what I think is right can not be wrong.
- Cyberia
- Site Admin
- Posts: 4790
- Joined: 01 Jan 1970 01:00
- Contact:
Re: O(n) sorting!
I've highlighted the flaw in it.... next.
- Dust
- The Boss
- Posts: 9093
- Joined: 01 Jan 1970 01:00
- Contact:
Och... but this one actually works:
http://www.dangermouse.net/esoteric/dropsort.html
(It's the first lossy sort algorithm I've seen)
http://www.dangermouse.net/esoteric/dropsort.html
(It's the first lossy sort algorithm I've seen)
I do what I think is right. But I don't think that what I think is right can not be wrong.
- Dust
- The Boss
- Posts: 9093
- Joined: 01 Jan 1970 01:00
- Contact:
I like that page. Interesting language:
http://www.dangermouse.net/esoteric/piet.html
Just look at the example code:
http://www.dangermouse.net/esoteric/piet/samples.html
http://www.dangermouse.net/esoteric/piet.html
Just look at the example code:
http://www.dangermouse.net/esoteric/piet/samples.html
I do what I think is right. But I don't think that what I think is right can not be wrong.
- Cyberia
- Site Admin
- Posts: 4790
- Joined: 01 Jan 1970 01:00
- Contact:
-
Jora
- Ex-boss
- Posts: 2338
- Joined: 01 Jan 1970 01:00
- Contact:
Re: O(n) sorting!
Obviously that is O(1), not O(n).
- Dust
- The Boss
- Posts: 9093
- Joined: 01 Jan 1970 01:00
- Contact:
-
Fuzzyduck
- Posts: 67
- Joined: 01 Jan 1970 01:00
- Contact:
-
Gianna
- Ex-boss
- Posts: 1020
- Joined: 01 Jan 1970 01:00
- Location: Bavaria, Germany
- Contact:
-
Stormwern
- Die-hard
- Posts: 1006
- Joined: 01 Jan 1970 01:00
- Location: Sweden
- Contact:
Who is online
Users browsing this forum: No registered users and 1 guest