HackerRank Data Structures Quiz -1

The Worst case time complexity of merge sort is nlogn

Explanation - It will print fibonacci series

Array:5 4 3 2  1

After first iteration: 4 5 3 2 1

After second iteration: 3 4 5 2 1

Explanation - This is a function to reverse the linked list

Explanation - Since this is a set , elements will be added just once.

Since all elements to the left of the 5 are smaller and all the elements to the right of 5 are greater, hence 5 is the answer.

Head= head->next->next, head= 3

Head= 3--> next, since there is no more node and hence this will throw error.

First pass of bubble sort:

1. 45321


2. 43521


3. 43251


4. 43215

1. 34215


2. 32415


3. 32145


4. 32145

Explanation - The avg time complexity of quick sort is nlogn

The Avg time complexity of Binary Search is logn.