List of top Algorithms Questions

Which sorting algorithm works by continuously swapping the adjacent elements ?

Let us consider for an Algorithm A, a nested loop and also a single loop is present what would be the time complexity for algorithm A ?

In bubble sort algorithm, every iteration through each element of a list is called?

Consider the following table of arrival time and burst time for three process P_o P₁ and P₂

Process	Arrival Time	Burst Time
Po	0 ms	9 ms
P1	1 ms	4 ms
P2	2 ms	9 ms

The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. What is the average waiting time for the three process

The average case complexity of Selection sort, Quick sort and Radix sort is respectively