A sorting algorithm takes 1 second to sort n = 1000 items.
1) How many operations will be performed if the sorting algorithm is O (n2) (approximately) ?
2) How long will it take to sort 10,000 items if the sorting algorithm is O (n2) ?
3) How much time will one operation take if the sorting algorithm is O (n2) ?
+1
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “A sorting algorithm takes 1 second to sort n = 1000 items. 1) How many operations will be performed if the sorting algorithm is O (n2) ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Home » Mathematics » A sorting algorithm takes 1 second to sort n = 1000 items. 1) How many operations will be performed if the sorting algorithm is O (n2) (approximately) ? 2) How long will it take to sort 10,000 items if the sorting algorithm is O (n2) ?