Wojciech Muła wojciech_mula at poczta.null.onet.pl.invalid
Sat Dec 13 14:04:02 EST 2008

• Previous message (by thread): [OT] stable algorithm with complexity O(n)
• Next message (by thread): [OT] stable algorithm with complexity O(n)
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

"David Hláčik" <david at hlacik.eu> wrote:

> I have to create stable algorithm for sorting n numbers from interval
> [1,n^2] with time complexity O(n) .

Some kind of radix sort or counting sort.  These algo. has O(n) complexity.

w.

---

• Previous message (by thread): [OT] stable algorithm with complexity O(n)
• Next message (by thread): [OT] stable algorithm with complexity O(n)
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list