[algogeeks] Re: Array and List comparison

Mon, 15 May 2006 20:05:55 -0700

The advantage of using a list is to delete and element it does that after a search in O(1) where as in an array we have to push all the elements after that deleted element one position backward. Same case with sorted insertion in an  array.

Thanks,
Manu

On 5/15/06, Kapil <[EMAIL PROTECTED]> wrote:

Use Array when
  you know the size of list, or if the list size is not too large
  Can use binary search while sorted array

Use List when
  you dont know the no. of elements you will be dealing with
  must avoid if information contained in a node is too lesser than the
size of pointer
  must use if you want to search on multiple attributes(you already
know)
  Can use binary tree, AVL balanced if needing sorted list, and also
needs searching





--
Manu Jose,
mob :09844467453
E-mail : [EMAIL PROTECTED]
-------------------------------------------------
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to