|
|
#2
28-Sep-2003, 18:41
|
|||
|
|||
|
Crikey,
that's going back a bit. I'm sure Dietel & Dietel C++ has it somewhere. Lemme see if I can remember, stack & queue & set & vector O(n), tree O(n^1/2), depends on it being sorted really. Essentially, if it's a linear search, like stepping though each element of an unsorted list (like stack, queue, set), it's O(n), if it's sorted (tree) & you're using binary search, it's O(n^1/2). GF |
Recent GIDBlog
Python ebook by crystalattice
| Thread Tools | Search this Thread |
| Rate This Thread | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Display Size and maybe download time | BobbyDouglas | MySQL / PHP Forum | 5 | 08-Nov-2003 01:18 |
| Selecting from 2 tables at the same time | soviet | MySQL / PHP Forum | 2 | 08-Nov-2003 00:15 |
| ambiguity in time field | zuzupus | MySQL / PHP Forum | 9 | 28-Jul-2003 09:40 |
| time Problem | zuzupus | MySQL / PHP Forum | 9 | 24-Jul-2003 08:02 |
| The Google update this time... | JdS | Search Engine Optimization Forum | 5 | 04-Jun-2003 16:25 |
Network Sites: GIDNetwork · GIDWebHosts · GIDSearch · Learning Journal by J de Silva, The
