TIME SPACE TRADE OFF AMONG ALGORITHMS
We know that in case of array, it is easy to search an element but it is difficult to insert and delete element from array. In case of linked list ,the situation is reverse it is easy to insert and delete element from linked list, but it is difficult to search an element .Here, we analyze the storage requirement of linked list is more than array, but is easy to insert and delete element fro it, but in case of array this is not so. Therefore, we have to find out a way by which we can balance the space and time requirements.
No comments:
Post a Comment