From 0526116b142bf232691b28835792337087ad469b Mon Sep 17 00:00:00 2001 From: Miloslav Ciz Date: Mon, 28 Mar 2022 21:38:37 +0200 Subject: [PATCH] Update alg --- algorithm.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/algorithm.md b/algorithm.md index ee8a021..d224a0f 100644 --- a/algorithm.md +++ b/algorithm.md @@ -58,6 +58,7 @@ Notice that *x*, *divisor counter* and *currently checked number* are [variables | increase divisor | | | count by 1 | | | | | | + | V | | --------------<------------- | V divisor count = 2 ? ------ @@ -119,8 +120,6 @@ As algorithms are at the heart of [computer science](scompsci.md), there's a lot From theoretical computer science we know not all problems are [computable](computability.md), i.e. there are problems unsolvable by any algorithm (e.g. the [halting problem](halting_problem.md)). [Computational complexity](computational_complexity.md) is a theoretical study of resource consumption by algorithms, i.e. how fast and memory efficient algorithms are. [Formal verification](formal_verification.md) is a field that tries to mathematically prove correctness of algorithms (this is needed for critical software, e.g. in planes). [Genetic programming](generic_programming.md) and some other methods of [artificial intelligence](ai.md) try to automatically create algorithms (creating algorithms that create algorithms). [Computer language](computer_language.md) design is an art of finding best ways of expressing algorithms. -TODO: sorting, searching, classical algorithms (primes, haugh transform, FFT, ...), time/space complexity, genetic programming, design patterns, fizzbuzz - ## Specific Algorithms Following are some common algorithms classified into groups.