• K-nearest neighbors (KNN)
  • How to use this book
  • Who should read this book
    		•

    Grokking Algorithms




    Download 24.82 Mb.
    Pdf ko'rish
    bet4/120
    Sana30.06.2022
    Hajmi24.82 Mb.
    #24606
    1   2   3   4   5   6   7   8   9   ...   120
    Bog'liq
    grokking-algorithms-illustrated-programmers-curious
    ppt 1, Oraliq nazorat Javoblari, 5-mustaqil ish, 5-мустақил иш, Илмий тадқиқот методологияси ишчи дастур 2020, Allayarov A. 2, ТПроформа договора по лоту №73719 (1), 7-topshiriq, 7-8-9 lab, Amplitudali modulyatsiya, 1-1610, fazliddin fozilov 123, Dasturlash 3 natija, Calendar plan-Maxsus fanlarni o\'qitish metodikasi (3)
    Graph algorithms
    —Covered in chapters 6 and 7. Graphs are a way to 
    model a network: a social network, or a network of roads, or neurons, 
    or any other set of connections. Breadth-first search (chapter 6) and 
    Dijkstra’s algorithm (chapter 7) are ways to find the shortest distance 
    between two points in a network: you can use this approach to 
    calculate the degrees of separation between two people or the shortest 
    route to a destination.
    • 
    K-nearest neighbors (KNN)
    —Covered in chapter 10. This is a 
    simple machine-learning algorithm. You can use KNN to build a 
    recommendations system, an OCR engine, a system to predict stock 
    values—anything that involves predicting a value (“We think Adit will 
    rate this movie 4 stars”) or classifying an object (“That letter is a Q”).
    • 
    Next steps
    —Chapter 11 goes over 10 algorithms that would make 
    good further reading.

    xvii
    How to use this book
    The order and contents of this book have been carefully designed. If 
    you’re interested in a topic, feel free to jump ahead. Otherwise, read the 
    chapters in order—they build on each other.
    I strongly recommend executing the code for the examples yourself. I 
    can’t stress this part enough. Just type out my code samples verbatim 
    (or download them from www.manning.com/books/grokking-
    algorithms or https://github.com/egonschiele/grokking_algorithms), 
    and execute them. You’ll retain a lot more if you do.
    I also recommend doing the exercises in this book. The exercises are 
    short—usually just a minute or two, sometimes 5 to 10 minutes. They 
    will help you check your thinking, so you’ll know when you’re off track 
    before you’ve gone too far.
    Who should read this book
    This book is aimed at anyone who knows the basics of coding and 
    wants to understand algorithms. Maybe you already have a coding 
    problem and are trying to find an algorithmic solution. Or maybe 
    you want to understand what algorithms are useful for. Here’s a short, 
    incomplete list of people who will probably find this book useful:
    • Hobbyist coders
    • Coding boot camp students
    • Computer science grads looking for a refresher
    • Physics/math/other grads who are interested in programming

    Download 24.82 Mb.
    1   2   3   4   5   6   7   8   9   ...   120




    Download 24.82 Mb.
    Pdf ko'rish