₦airaland Forum

street runs na for piss poor guys.

oh yea

really. na wa o !

^^ how u go understand 

sylve11:
na wa o

u

nobody

^^ he is a man na. no be woman u dey find

[quote author=hope_Alive link=topic=410052.msg6096620#msg6096620 date=1274879455]Africhat and money peddlers[/quote]what do u mean

exactly

Season 2 . that is so last year

those guys were piss poor yesterday

swit D:
I'm missing her so much

hey where have u been

The time taken is related to their relative complexity

- How long does it take to add an element to :
    * a map - constant
    * a list - constant
- How long does it take to find an element from:
    * list -  depends on the algorithm . . binary search or linear search
    * array - same as list
    * sorted list - linear if u do a linear search. But binary search is faster
    * sorted array - as as sorted list
    * tree - quadratic
    * hashmap - constant
- How long does it take to sort a list of n elements
  Depends on the sort algorithm you use. Quick or Merge sort are usually the fastest

So if you are concerned about speed the best datastructure to use is a Hashmap/Hashtable (although they are not suitable for most uses) because they are the fastest for addition and retreival of elements

<NO>