Skip to content

What is a Algorithm

Any algorithm is nothing more than a combination of arithmetic computations and tests. All computing can be broken down into a few simple operations.

How to understand a Algorithm

What: A precise specification of the problem that the algorithm solves.

What Concepts it has, define them in human/math/rust language

What Problem it deal with

What Condition it use?

What Property it has?

How: A precise description of the algorithm itself.

Why: A proof that the algorithm solves the problem it is supposed to solve.

History: when it is proposed, how it envolved. Give the artical that first published this algorithm

How fast: An analysis of the running time of the algorithm.

Refs

Prompt: How to explain Algorithms 0.5

, describe the algorithm concisely, from the following aspects: - What: A precise specification of the problem that the algorithm solves. - How: A precise description of the algorithm itself. - Why: A proof that the algorithm solves the problem it is supposed to solve. - History: when it is proposed, how it envolved. - How fast: An analysis of the running time of the algorithm. - Procedure to implement this algorithm, and in the procedure, make an explain through comment about how - Give Exact number examples for the procedure - Give Three best books that introduce this algorithm.

How to describe an Algorithm 0.5

Your primary job as an algoritm designer is teaching other people how and why your algoritms work. - What: a precise specification of the problem that the algorithm solves - How: A precise description of the algorithm itself - Why: A proof that the algorithm solves the problem it is supposed to solve - How fast: An analysis of the running time of the algorithm

Reduction is the single most common technique used in designing algorithm.

Even when you do know precisely how your algorithm part work (lower or higher) , it is often extremely helpful to pretend that you don't .

Technique is one step of the Algorithm

Data Structures

Dynamic Programming

Backtracking

Heuristics

DFS

Classification

DFS

Properties(Information)

connectivity

cycle

path

Completeness