• You can log in to your eeworld account to continue watching:
  • Quicksort Overview
  • Login
  • Duration:12 minutes and 8 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

Urgently looking for MMS wireless module! ! ! ! ! ! !
Mainly need to have an agent in Qingdao
xingaodu Embedded System
FPGA/CPLD digital circuit design experience sharing
In the design of digital circuits, timing design is a major indicator of system performance. In high-level design methods, the abstraction of timing control is also increased accordingly, so it is dif
心仪 FPGA/CPLD
What does Newcomer Post mean?
Recently I saw some posts on the forum marked with "Newcomer Post". What does this mean? How long does it take to be considered a newcomer?
tiankai001 Suggestions & Announcements
Novice help: Use Delphi to write a program for PC to communicate with microcontroller. Please give me the general idea.
rt. What function to use? I'm making something, and I've rarely used Delphi before, so please help me, thank you.
dhu2060427 Embedded System
EEWORLD University Hall----Detailed Explanation of Current Sensing Amplifier
Detailed explanation of current sensing amplifier : https://training.eeworld.com.cn/course/3806
hi5 Analog electronics
About .out disassembly
I tried to disassemble a 513K .out file using dis2000, and it turned out to be 7632K. Open it with Notepad and find only .sect ".data" 00300000 b2bd .word 0xb2bd 00300001 8f00 .word 0x8f00 00300002 c6
djx Microcontroller MCU

Recommended Content

Circuit

可能感兴趣器件

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号