#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/proving-greedy-correctness/minimum-waiting-algorithm

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/proving-greedy-correctness/minimum-waiting-algorithm

Repovive

Minimum Waiting - Algorithm - Proving Greedy Correctness | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Minimum Waiting - Algorithm

Simple implementation

This algorithm is simple:

function minimumWaitingTime(times)
 sort times in ascending order
 totalWaiting := 0
 cumulativeTime := 0
 for i from 0 to length of times - 1
 totalWaiting := totalWaiting + cumulativeTime
 cumulativeTime := cumulativeTime + times[i]
 return totalWaiting

Time: $O(n \log n)$ for sorting. Space: $O(1)$ extra.