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
no comments