gilbert189 — 2/26/2025, 2:30:49 AM
procedure insertion sort(a_1, a_2, ..., a_n)
...
    while a_j < a_i
        i := i + 1 // WHERE DO WE GO FROM HERE?
    m := a_j

This is what we are debating on discrete math class

♥ 1 ↩ 0 💬 0 comments

comments

no comments