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

Understanding linear programming

Many real world problems are maximizing or minimizing an objective, with some given constraints. One approach is to specify the objective as a linear function of some variables. We also formulate the constraints on resources as equalities or inequalities on those variables. This approach is called the linear-programming problem. The basic algorithm behind linear programming was developed by George Dantzig at the University of California at Berkeley in the early 1940s. Dantzig used this concept to experiment with logistical supply-and-capacity planning for troops while working for the US Air Force. At the end of the Second World War, Dantzig started working for the Pentagon and matured his algorithm into a technique that he named linear programming. It was used for military combat planning. Today, it is used to solve important real-world problems that relate to minimizing or maximizing a variable based on certain constraints. Some examples of these problems...