Compute polynomial, Cn.x^n + Cn-1.x^(n-1) + … … + C2.x^2 + C1.x + C0
June 12, 2012
Non-leaf nodes of a binary tree
June 12, 2012

Difference between linked list and Arrays

Locality of reference is very good in arrays. Suppose if you are reading an array of size 100, then all the elements will be adjacent to each other, If that array is stored on hard disk, then the head does not need to be moved much, but in case of linked list, the physical location of elements may be scattered and hence lot of head movement may require (for externally stored list).

Next: Sorting …

1 Comment

  1. anuj says:

    why we can not use binary search in linked list even it is sorted,what is main reason behind this fact?

Leave a Reply

Your email address will not be published. Required fields are marked *