Which scheduling algorithm gives a minimum average waiting time?

Shortest Job First (SJF) scheduling algorithm is provably optimal because it minimizes the average waiting time for a given set of processes. By scheduling the process with the shortest CPU burst time first, the waiting times of subsequent longer processes are reduced, moving the overall mathematical average to its minimum possible value.

Thus, the correct option is C.