You're reading from 50 Algorithms Every Programmer Should Know Tackle computer science challenges with classic to modern algorithms in machine learning, software design, data systems, and cryptography

Product type Paperback

Published in Sep 2023

Publisher Packt

ISBN-13 9781803247762

Length 538 pages

Edition 2nd Edition

Languages

Processing

Tools

Processing

Concepts

Data Structures and Algorithms

Author (1):

Imran Ahmad

View More author details

Table of Contents (22) Chapters

Preface

1. Section 1: Fundamentals and Core Algorithms FREE CHAPTER

2. Overview of Algorithms

3. Data Structures Used in Algorithms

4. Sorting and Searching Algorithms

5. Designing Algorithms

6. Graph Algorithms

7. Section 2: Machine Learning Algorithms

8. Unsupervised Machine Learning Algorithms

9. Traditional Supervised Learning Algorithms

10. Neural Network Algorithms

11. Algorithms for Natural Language Processing

12. Understanding Sequential Models

13. Advanced Sequential Modeling Algorithms

14. Section 3: Advanced Topics

15. Recommendation Engines

16. Algorithmic Strategies for Data Handling

17. Cryptography

18. Large-Scale Algorithms

19. Practical Considerations

20. Other Books You May Enjoy

21. Index

Performance analysis

Analyzing the performance of an algorithm is an important part of its design. One of the ways to estimate the performance of an algorithm is to analyze its complexity.

Complexity theory is the study of how complicated algorithms are. To be useful, any algorithm should have three key features:

Should be correct: A good algorithm should produce the correct result. To confirm that an algorithm is working correctly, it needs to be extensively tested, especially testing edge cases.
Should be understandable: A good algorithm should be understandable. The best algorithm in the world is not very useful if it’s too complicated for us to implement on a computer.
Should be efficient: A good algorithm should be efficient. Even if an algorithm produces the correct result, it won’t help us much if it takes a thousand years or if it requires 1 billion terabytes of memory.

There are two possible types of analysis to quantify the...