Answer to Question #130627 in Software Engineering for Harmanpreet Kaur

Question

Suppose that a software engineer decides to use the insertion sort to (ascending) sort the addresses of the residents of the city of Toronto. Briefly explain why this is a bad idea

Answer 1

The insertion sort algorithm has a computational complexity O(n²) and is therefore suitable for small amounts of data. Considering that Toronto has about 3 million residents, this algorithm is not suitable due to the large amount of computational resources expended.