A loop is made from k (0) to the value of 'n' (not know here), incrementing k
k is not used inside the loop
a[i][j] is swaped with a[j][i] many times, but i and j don't advance, just the same is made (k-n-1) times.
1) both k and a[i][j] are initialized to 0
2) no, it incriments the value of k to n, checks the condition and then exits the loop
0
travishabermanAuthor Commented:
Thank you all,
Olivares,
My code is nonsense because it is a question from a book and the point is to evaluate the complexity big O(n).
0
Featured Post
With monday.comâ€™s project management tool, you can see what everyone on your team is working in a single glance. Its intuitive dashboards are customizable, so you can create systems that work for you.
a[i][j] is initialized to 0
k is initialized to 0
A loop is made from k (0) to the value of 'n' (not know here), incrementing k
k is not used inside the loop
a[i][j] is swaped with a[j][i] many times, but i and j don't advance, just the same is made (k-n-1) times.