Posted by: atri | September 15, 2010

## Lect 7: GS Algorithm Terminates

In today’s lecture, we proved that for every inut of size $n$, the while loop in the algorithm runs at most $n^2$ times. The slides have been uploaded.