Reliance Jio DSA Quiz 2

Because their nodes are not connected in a sequential manner.

Single ended Queue is not a type of Queue.

Stack is used to implement recursion by compiler

Prim's algorithm finds the subset of edges that includes every vertex of the graph such that the sum of the weights of the edges can be minimized .

Dequeue is used for insertion and deletion both.

Quick Sort is a Divide and Conquer algorithm

Merge Sort will always have a time complexity of O ( n * logn ) which is the best time complexity in the worst case among all the algorithms .

Thus , the number of swaps for the entire sort operation is n - 1 less than the number of comparisons . This is 0 in the best case , and (n2) in the average and worst cases .

Selection sort performs mostly n - 1 swaps between data elements , while the bubble sort swaps n ( n - 1 ) / 2 elements in the worst case .

Worst Case input in Insertion sort for maximum number of swaps will be an already sorted array in ascending order .