Abstract
In the previous chapter we reviewed two algorithms to sort the n elements contained in a vector C[0 : n−1]: INSERTION SORT and MERGE SORT, which belong to the Olympus of classical algorithms. The first one, built according to a simple strategy, has a time complexity proportional to n2; the second one, which is more sophisticated, has a time complexity proportional to n log2 n, and is thus more efficient than the first.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ferragina, P., Luccio, F. (2018). “Easy” and “Difficult” Problems. In: Computational Thinking. Springer, Cham. https://doi.org/10.1007/978-3-319-97940-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-97940-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97939-7
Online ISBN: 978-3-319-97940-3
eBook Packages: Computer ScienceComputer Science (R0)