Trace g = [1,2,3], s = [3,1,2].
Sort: g = [1,2,3], s = [1,2,3].
i=0 (child greed 1), j=0 (cookie size 1):
- 1 >= 1. Satisfied! i=1, j=1. Count=1.
i=1 (greed 2), j=1 (size 2):
- 2 >= 2. Satisfied! i=2, j=2. Count=2.
i=2 (greed 3), j=2 (size 3):
- 3 >= 3. Satisfied! i=3, j=3. Count=3.
All children satisfied. Answer: .
time for sorting. extra space.