• You can log in to your eeworld account to continue watching:
  • Choosing a Good Pivot
  • Login
  • Duration:22 minutes and 25 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

AD and DA chip collection (data and programs)
AD and DA chip collection (data and programs), share it
Yeah_Roger Analog electronics
Earn points~~~
zyandll123 Embedded System
Finance Quiz
If a person spends 50,000 yuan to buy an antique, and then sells it for 60,000 yuan, and then regrets the sale, and then buys it back for 70,000 yuan, and then sells it again for 80,000 yuan, how much
hkn Talking
About vec debugging. Waiting online
Regarding vec debugging, how can I adjust the frequency to be correct (specific parameters) For example: 720*572 (13.5hz) is converted to vga 800*600 (75hz). The size can be jumped out, but 75hz canno
tang_lixin Embedded System
How relevant are the 74LS164 timing diagrams to actual applications?
Recently I read about the usage of 74LS164 and some related programs. With the timing diagram, it seems that there is basically no connection. The program usually loops 8 times, checking one bit each
yanse51 51mcu
Xiuxiu received the NXP prize starry sky calendar from EEWORLD
Xiuxiu received the NXP prize starry sky perpetual calendar from EEWORLD. She won the prize by answering questions in EEWORLD. It was originally a computer inner sleeve bag, but it was replaced with t
wangfuchong 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号