and how to use time and space complexity functions to compare similar algorithms. Once you’ve got these basics, you’ll be ready to learn about searching and sorting with one-dimensional arrays ...

Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

Examination of problem areas such as searching and sorting, and the indicated representations and algorithms. The student will ... establishing algorithmic correctness and estimating time and space ...

Most problems can be solved by many different algorithms, each with its own demands on time and space. Complexity theorists sort problems into categories, called complexity classes, based on the ...