JavaScript Algorithms
The Web Developer’s Guide to Data Structures and AlgorithmsOleksii Trekhleb, Sophia Shoemaker
- ناشرFullstack.io
- سال انتشار2019
- ویرایش1
- زبانEnglish
- تعداد صفحات292
- شابک**********
739,000 تومان – 1,787,000 تومانمحدوده قیمت: 739,000 تومان تا 1,787,000 تومان
تحویل اکسپرس
حمل رایگان سفارشات بالای 1 میلیون تومان
پرداخت امن
امکان پرداخت انلاین یا پرداخت حضروی درب منزل
ضمانت اصالت کالا
امکان پرداخت انلاین یا پرداخت حضروی درب منزل
7 روز گارانتی بازگشت وجه
امکان پرداخت انلاین یا پرداخت حضروی درب منزل
As a JavaScript developer you might think you don’t need to learn about data structures or algorithms.
Did you know JavaScript itself (runtime + browser) uses things like a stack, a heap and a queue? The more you understand the JavaScript you use on a daily basis – really understand it, the better you can wield it’s power and make less mistakes. If you thought algorithms and data structures were just a computer science course that wasn’t necessary on a day to day basis as JavaScript developer, think again!
How To Read This Book
Each chapter covers an algorithm you might encounter in your work or at an interview. You can work through the algorithms one at a time or feel free to jump around.
What is an Algorithm
In this book, we’re going to write algorithms – the sets of steps that will solve specific problems for
us.
We constantly use algorithms in our everyday life. For example what if we’re somewhere on a street and want to get home to our apartment that is on the 20th floor? In order to achieve that we could do the following:
1. Take a WALK to your home.
2. Use STAIRS to go up to the 20th floor.
This is an algorithm. We’ve defined and used the set of steps that solve our task of getting home.
Contents
- Introduction
- How To Read This Book
- Algorithms and Their Complexities
- Linked List
- Queue
- Stack
- Hash Table
- Binary Search Tree (BST)
- Binary Heap
- Priority Queue
- Graphs
- Bit Manipulation
- Factorial
- Fibonacci Number
- Primality Test
- Is a power of two
- Search. Linear Search.
- Search. Binary Search.
- Sets. Cartesian Product.
- Sets. Power Set.
- Sets. Permutations.
- Sets. Combinations.
- Sorting: Quicksort
- Trees. Depth -First Search.
- Trees. Breadth -First Search.
- Graphs. Depth -First Search.
- Graphs. Breadth -First Search.
- Dijkstra’s Algorithm
Appendix A: Quiz Answers
Appendix 8: Big O Times Comparison
Appendix C: Data Structures Operations Complexities
Appendix D: Array Sorting Algorithms Complexities
| ناشر | Fullstack.io |
|---|---|
| ویرایش | 1 |
| زبان | English |
| سال انتشار | 2019 |
| شابک | ********** |
| تعداد صفحات | 292 |
| قطع | B5 |
| کیفیت | اورجینال انتشارات |
| نوع چاپ | رنگی, سیاه و سفید |
| نوع جلد | جلد سخت, شومیز, طلقی |
محصولات مشابه

نقد و بررسیها
هنوز بررسیای ثبت نشده است.