• You can log in to your eeworld account to continue watching:
  • Decision, Search, and Optimization
  • Login
  • Duration:7 minutes and 36 seconds
  • Date:2022/05/28
  • Uploader:桂花蒸
Introduction
keywords: algorithm
The first volume of the four-part Detailed Explanation of Algorithms explains the basics of algorithms in detail and shows the essence of algorithms. It integrates many years of teaching experience of Stanford University professors and explains the profound things in a simple and easy-to-understand way.

Algorithms are the core and soul of computer science. Algorithms have a wide range of applications and are required for the implementation of network routing, computational genomics, public key cryptography and database systems. Studying algorithms can help us become better programmers, enable us to think more carefully, and successfully cope with technical interviews on various occasions.

This is a very easy-to-use introductory book on algorithms. It can be used as a learning book for programmers, and is also suitable for readers who want to learn algorithms and improve their algorithmic thinking skills.

This book mainly includes the following contents:
asymptotic analysis;
Big O notation;
master method;
fast divide and conquer algorithm;
randomization algorithm;
sorting algorithm;

Choose an algorithm.

Algorithms are the core and soul of computer science. Algorithms have a wide range of applications and are required for the implementation of network routing, computational genomics, public key cryptography and database systems. Studying algorithms can help us become better programmers, enable us to think more carefully, and successfully cope with technical interviews on various occasions.
This is a very easy-to-use introductory book on algorithms. It can be used as a learning book for programmers, and is also suitable for readers who want to learn algorithms and improve their algorithmic thinking skills.
This book mainly includes the following contents:
graph search and application;
hash table;
shortest path algorithm;
Bloom filter;
randomization algorithm;
heap;
search tree.


Unfold ↓

You Might Like

Recommended Posts

A few points to learn about the PCB design of smart bracelets
[align=left][font=Arial, Tahoma, Geneva, sans-serif] [size=4][color=#000000]Smart bracelets, as a popular product in the past two years, have attracted more and more attention. Although not all people
qwqwqw2088 PCB Design
Raspberry Pi 4B and other information sharing
Raspberry Pi 4B Raspberry Pi 4 B is the latest in the Raspberry Pi family. Compared to the previous generation Raspberry Pi 3 B+, Raspberry Pi 4 B offers breakthrough improvements in processor speed,
okhxyyo Special Edition for Assessment Centres
How to quickly learn electronic technology
This is a big problem. Solving this problem is a systematic project. First of all, it takes time, more reading and more practice. Electronic technology and radio maintenance technology are by no means
lhy FPGA/CPLD
At Banzhu's request, the weekend
Increase the popularity of a weekend
sealcold Embedded System
linknode makes wearable devices
Our task is to use LinkNode to make a wearable device. My idea is to use the temperature sensor of the board to make a temperature sensor. When the user is in a low-temperature air-conditioned room fo
行走的大白 DIY/Open Source Hardware
I wish you all all your wishes come true in the Year of the Horse!
Hey, who else is still online? PS: Don’t forget the forum’s New Year event! [url=https://en.eeworld.com/bbs/thread-429179-1-1.html]https://en.eeworld.com/bbs/thread-429179-1-1.html[/url]
soso Talking

Recommended Content

可能感兴趣器件

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京B2-20211791 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号