Analysis

Stack Implementation

Sort: O(n lg n)
Push/Pop Naive: O(n²)
Push/Pop Aggregate: O(n)

Graham's Scan algorithm takes O(n lg n) time.