Striver, your DSA Sheet is absolutely phenomenal! It's been an invaluable resource for mastering data structures and algorithms. Looking forward to the remaining topics, especially the much-anticipated sections on strings and heaps. Thanks for all your hard work!
Given is burst time. You need to take average of wait time. And shortest burst time need to be executed first, hence sorting required else you might take bigger burst time first.
ig without shorting you can't impliment sjf because the requirement is smallest will be executed first and for the sake of chossing smallest sorting is necessary. correct me if i am wrong
We are calculating waiting time for other processes. If we don't sort, even the process with smaller execution time will have to wait longer which will violate the SJF scheduling algo
