Algo

Question

Which of the following data structure will be most efficient for inserting  a number into a sorted list of numbers ?

1. Stack
2. Queue
3. Linked List
4. Array

Answer 1

Answer is Linked List.

1) For the stack you need Push and Pop to put an element in sorted order.

2) For the Queue you need insert and delete to put an element in sorted order.

4) In the array you may have to move the data, and it will get worst if the array is full then you have to create another array of bigger size and then copy that data.

But In 

3) Linked List you just have to traverse the list by having the record of previous node. Nothing else. Hence. the answer.