Algorithms are step-by-step procedures that solve problems by processing input to produce output using computers. They are theoretically important as the core of computer science and practically important as tools for designing algorithms for new problems. The document discusses the importance of algorithms in computer science and provides examples of common algorithms like searching and sorting algorithms. It also outlines how algorithms are essential for programming, robotics, networking, graphical user interfaces, and app development.
3. Algorithms in Computer Science
Theoretical importance
-The core of computer science
Practical importance
-A practitioners toolkit of known algorithms
-Framework for designing and analyzing algorithms for new problems
Complexity
Time Complexity Space Complexity