• You can log in to your eeworld account to continue watching:
  • Implementation as a Descending Clock Auction
  • Login
  • Duration:28 minutes and 46 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

NEC develops new battery with a thickness of only 0.3 mm
For many people, organic free radical battery may be a very unfamiliar name. Organic free radical battery is developed by NEC. Compared with traditional lithium battery, organic free radical battery c
wstt Creative Market
Key points of RF circuit and chip design
"Key Points of RF Circuit and Chip Design" (Chinese version) focuses on key issues such as impedance matching, grounding, single-ended to differential conversion, tolerance analysis, noise and gain an
arui1999 Download Centre
TMS320C55x assembly language knowledge--macro instructions
If you need to execute a certain section of a program multiple times, you can define it as a macro, and then call the macro where you need to repeat it. If you need to reference a macro multiple times
Jacktang DSP and ARM Processors
Help with CORDIC algorithm to find the inverse tangent
I have read some information about the CORDIC algorithm. Now I want to use the CORDIC algorithm to calculate the inverse tangent. I would like to ask what are the main issues to consider when calculat
zhao_q FPGA/CPLD
Looking for an audio switching chip
I have used an audio switching chip (HEF4051BT) before, which is an eight-choice audio selection chip (but it can only switch mono audio). Now I want to find an audio switching chip that can switch bo
小曹111 Analog electronics
Instructions for using the Dacai IoT serial port screen to browse audio and video files in USB flash drives and SD cards
[i=s]This post was last edited by dcolour2019 on 2019-7-2 14:36[/i]Dacai IoT serial port screen can traverse the files in the external U disk or SD card by adding LUA program. In the example project d
dcolour2019 MCU

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号