From 6bc62ed5a4affb7da1b4db84768a7a6ec165d498 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Anton=20=C3=84lgmyr?= Date: Thu, 18 Oct 2018 15:43:25 +0200 Subject: [PATCH 1/2] Fix headers that matter --- src/algebra/balanced-ternary.md | 2 +- src/algebra/phi-function.md | 2 +- src/dynamic_programming/divide-and-conquer-dp.md | 2 +- src/graph/strongly-connected-components.md | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/algebra/balanced-ternary.md b/src/algebra/balanced-ternary.md index f58766290..bbb235a78 100644 --- a/src/algebra/balanced-ternary.md +++ b/src/algebra/balanced-ternary.md @@ -1,5 +1,5 @@ -#Balanced Ternary +# Balanced Ternary !["Setun computer using Balanced Ternary system"](http://ternary.3neko.ru/photo/setun1_small.jpg) diff --git a/src/algebra/phi-function.md b/src/algebra/phi-function.md index 2f0c79a2f..9087f2798 100644 --- a/src/algebra/phi-function.md +++ b/src/algebra/phi-function.md @@ -1,5 +1,5 @@ -#Euler's totient function +# Euler's totient function Euler's totient function, also known as **phi-function** $\phi (n)$, counts the number of integers between 1 and $n$ inclusive, which are coprime to $n$. Two numbers are coprime if their greatest common divisor equals $1$ ($1$ is considered to be coprime to any number). diff --git a/src/dynamic_programming/divide-and-conquer-dp.md b/src/dynamic_programming/divide-and-conquer-dp.md index e15035280..0c41a1b0c 100644 --- a/src/dynamic_programming/divide-and-conquer-dp.md +++ b/src/dynamic_programming/divide-and-conquer-dp.md @@ -1,6 +1,6 @@ -#Divide and Conquer DP +# Divide and Conquer DP Divide and Conquer is a dynamic programming optimization. diff --git a/src/graph/strongly-connected-components.md b/src/graph/strongly-connected-components.md index 9ca23c3be..d67e52fe8 100644 --- a/src/graph/strongly-connected-components.md +++ b/src/graph/strongly-connected-components.md @@ -1,6 +1,6 @@ -#Finding strongly connected components
Building condensation graph +# Finding strongly connected components
Building condensation graph ## Definitions You are given a directed graph $G$ with vertices $V$ and edges $E$. It is possible that there are loops and multiple edges. Let's denote $n$ as number of vertices and $m$ as number of edges in $G$. From 30a91ce44f4ed0a96dc4edf804467df4c5388ef8 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Anton=20=C3=84lgmyr?= Date: Thu, 18 Oct 2018 15:45:30 +0200 Subject: [PATCH 2/2] Fix headers that matter less --- src/contrib.md | 12 ++++++------ src/demo-article.md | 6 +++--- 2 files changed, 9 insertions(+), 9 deletions(-) diff --git a/src/contrib.md b/src/contrib.md index 62ca0cd28..b5c910bea 100644 --- a/src/contrib.md +++ b/src/contrib.md @@ -1,5 +1,5 @@ -#How to Contribute +# How to Contribute ## General information @@ -27,11 +27,11 @@ Please kindly refer to manuals on using `git` and `github` anywhere over interne -##Your Authorship is Preserved +## Your Authorship is Preserved Some contributors add explicit links to their profiles at the bottom of the translated articles. However it is discouraged and simply not very convenient if the article was edited by several people. Every page has `Page Authors` link in its top - this link leads to the github commit history, so it is always easy to determine or prove the authorship (even of any single line). Just make sure that your GitHub profile (which is mentioned in history) provides enough information about you. -##Source format +## Source format We use [Markdown](https://daringfireball.net/projects/markdown) for source texts and convert them automatically to HTML. @@ -45,11 +45,11 @@ And here is the formula in the separate block: $$E = mc^{2}$$ -##Some conventions +## Some conventions * We have agreed as of issue [#83](https://github.com/e-maxx-eng/e-maxx-eng/issues/83) to express binomial coefficients with `\binom{n}{k}` instead of `C_n^k`. The first one renders as $\binom{n}{k}$ and is a more universal convention. The second would render as $C_n^k$. -##Adding images +## Adding images Small images could be pushed along with texts to the [/img](https://github.com/e-maxx-eng/e-maxx-eng/tree/master/img) subfolder. Let them be in `PNG` format and less than `200kb`. Then you can refer to them inside the article with the tag: @@ -75,7 +75,7 @@ And then link to it from the same or a different article: For more detail read the [Implementation](#implementation). More infos in [Impl. of Segmenttree](./data_structures/segment_tree.html#implementation). -##Page Template +## Page Template Template for the pages (the one which creates small violet header and footer, determines the layout of the text, includes css and js files) is now also stored in this repo, in [src/\_templates](https://github.com/e-maxx-eng/e-maxx-eng/tree/master/src/_templates) folder. So in case you find some bugs in it, or with the passing of time some new features may be needed in it - create PR to improve it. Note that for testing purposes the alternative template could be created and used for specific page with the inclusion of special comment as shown below: diff --git a/src/demo-article.md b/src/demo-article.md index 95407e20a..ca8e33ef1 100644 --- a/src/demo-article.md +++ b/src/demo-article.md @@ -1,6 +1,6 @@ -#Demo Article +# Demo Article _You can [see the source of this article](https://raw.githubusercontent.com/e-maxx-eng/e-maxx-eng/master/src/demo-article.md) to better understand formatting features._ @@ -33,7 +33,7 @@ the preceding paragraph Show/Hide return result; } -###TeX and Markdown references +### TeX and Markdown references We use [Markdown](https://daringfireball.net/projects/markdown) for source texts and convert them automatically to HTML. @@ -47,7 +47,7 @@ And here is the formula in the separate block: $$E = mc^{2}$$ -###Adding images +### Adding images Small images could be pushed along with texts to the [/img](https://github.com/e-maxx-eng/e-maxx-eng/tree/master/img) subfolder. Let them be in `PNG` format and less than `200kb`. Then you can refer to them inside the article like this (see the source here): pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy