Provid the asymptotic time complexity T and space complexity S for the following

Question

Provid the asymptotic time complexity T and space complexity S for the following algorithm without any assumption about k. Please explain how you come up with the answer. Also please explain what is space complexity? Something has to do with memeory?

int select(int* A, int n, int k) {

int index, value;

for (int i = 0; i < k; ++i) {

  index = i; value = A[i];

for (int j = i + 1; j < n; ++j) {

  if (A[j] < value) {

index = j; value = A[j];

}

}

  std::swap(A[i], A[index]);

}

return A[0];

}

Explanation / Answer

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.