There are n jobs are waiting in the ready queue and the CPU uses a non-preemptive shortest job first scheduling algorithm. what is the time complexity of the shortest job first algorithm when jobs are non-preemptive in nature?
1
O(n)
2
O(n log n)
3
O(1)
4
\(O(\sqrt n)\)
5
Question Not Attempted