From 39e6d5196b6fddeaf8dc4d0f4c50d4ffc21ac4bd Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Sun, 11 Dec 2022 21:30:38 +0100 Subject: [PATCH] fix: redo descriptions and add tags Signed-off-by: Matej Focko --- .../02-algorithms-correctness/postcondition-ambiguity.md | 8 ++++++-- ib002/03-time-complexity/extend.md | 6 ++++++ ib002/08-rb-trees/applications.md | 7 +++++-- ib002/10-graphs/bfs-tree.md | 3 +++ ib002/10-graphs/iterative-and-iterators.md | 7 ++++++- 5 files changed, 26 insertions(+), 5 deletions(-) diff --git a/ib002/02-algorithms-correctness/postcondition-ambiguity.md b/ib002/02-algorithms-correctness/postcondition-ambiguity.md index fa8af4a..553d906 100644 --- a/ib002/02-algorithms-correctness/postcondition-ambiguity.md +++ b/ib002/02-algorithms-correctness/postcondition-ambiguity.md @@ -1,8 +1,12 @@ --- title: Vague postconditions and proving correctness of algorithms description: | - Practical example that shows how precise postconditions can help with both - debugging and testing of the code. + Debugging and testing with precise postconditions. +tags: +- python +- testing +- postconditions +- sorting --- ## Introduction diff --git a/ib002/03-time-complexity/extend.md b/ib002/03-time-complexity/extend.md index 6abbbab..c77949a 100644 --- a/ib002/03-time-complexity/extend.md +++ b/ib002/03-time-complexity/extend.md @@ -2,6 +2,12 @@ title: Time complexity of ‹extend› description: | How to make inefficient algorithm unknowingly. +tags: +- c +- python +- dynamic array +- time complexity +- recursion --- ## Introduction diff --git a/ib002/08-rb-trees/applications.md b/ib002/08-rb-trees/applications.md index 5a016ee..1bbbd56 100644 --- a/ib002/08-rb-trees/applications.md +++ b/ib002/08-rb-trees/applications.md @@ -1,8 +1,11 @@ --- title: Použití červeno-černých stromů description: | - Ukázka použití červeno-černých stromů pro implementaci množiny nebo mapy - a ukázky jednotlivých implementací ve standardních knižnicích známých jazyků. + Ukázka použití červeno-černých stromů v standardních knižnicích známých jazyků. +tags: +- balanced trees +- red-black trees +- applications --- ## Použití diff --git a/ib002/10-graphs/bfs-tree.md b/ib002/10-graphs/bfs-tree.md index 77e9163..d2e7aa5 100644 --- a/ib002/10-graphs/bfs-tree.md +++ b/ib002/10-graphs/bfs-tree.md @@ -2,6 +2,9 @@ title: Distance boundaries from BFS tree on undirected graphs description: | Short explanation of distance boundaries deduced from a BFS tree. +tags: +- graphs +- bfs --- ## Introduction diff --git a/ib002/10-graphs/iterative-and-iterators.md b/ib002/10-graphs/iterative-and-iterators.md index 4755318..e4c8dab 100644 --- a/ib002/10-graphs/iterative-and-iterators.md +++ b/ib002/10-graphs/iterative-and-iterators.md @@ -1,7 +1,12 @@ --- title: Iterative algorithms via iterators description: | - Examples of iterative implementations of DFS using iterators. + Iterative DFS using iterators. +tags: +- csharp +- graphs +- iterators +- iterative --- ## Introduction