Bookbot

Algorithms

Ocena książki

Parametry

  • 144 strony
  • 6 godzin czytania

Więcej o książce

This book serves as an introduction to algorithms for readers with minimal computer science background. It covers a broad spectrum of algorithms, including those related to music, searching, sorting, deep learning, and graphs. The author emphasizes practical applications, focusing on how algorithms function rather than just their capabilities. Unlike many texts that explore technological applications and implications, this book aims to clarify the inner workings of algorithms. Louridas addresses classic algorithms like searching and sorting—essential tools in most applications—while also exploring diverse topics such as algorithms in music, non-traditional searching methods (like the secretary problem), graph algorithms, and the PageRank algorithm. He introduces deep learning with practical insights and discusses the limits of computability. The book concludes with a thought-provoking examination of the implications of these algorithms. Many algorithm books tend to be overly technical or too simplistic, often explaining what algorithms do without detailing how they operate. This book seeks to balance these approaches, demonstrating that algorithms can be articulated in straightforward terms. Ultimately, it aims to make algorithms accessible enough for anyone to execute them with just a pen and paper.

Zakup książki

Algorithms, Panos Louridas

Język
Rok wydania
2020
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

4,0
Bardzo dobra
178 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
Algorithms
Język
angielski
Wydawca
MIT Press
Rok wydania
2020
Oprawa
miękka
Liczba stron
144
ISBN10
0262539020
ISBN13
9780262539029
Seria
Ocena
4 z 5
Opis
This book serves as an introduction to algorithms for readers with minimal computer science background. It covers a broad spectrum of algorithms, including those related to music, searching, sorting, deep learning, and graphs. The author emphasizes practical applications, focusing on how algorithms function rather than just their capabilities. Unlike many texts that explore technological applications and implications, this book aims to clarify the inner workings of algorithms. Louridas addresses classic algorithms like searching and sorting—essential tools in most applications—while also exploring diverse topics such as algorithms in music, non-traditional searching methods (like the secretary problem), graph algorithms, and the PageRank algorithm. He introduces deep learning with practical insights and discusses the limits of computability. The book concludes with a thought-provoking examination of the implications of these algorithms. Many algorithm books tend to be overly technical or too simplistic, often explaining what algorithms do without detailing how they operate. This book seeks to balance these approaches, demonstrating that algorithms can be articulated in straightforward terms. Ultimately, it aims to make algorithms accessible enough for anyone to execute them with just a pen and paper.