mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-11-10 11:09:43 +08:00
Testing Codecov integration without web-hooks.
This commit is contained in:
Oleksii Trekhleb
parent
6d2d8c9379
commit
ee35bd6240
@ -321,3 +321,5 @@ npm test -- 'playground'
|
|||||||
> يمكنك دعم هذا المشروع عبر ❤️️ [GitHub](https://github.com/sponsors/trekhleb) أو ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
> يمكنك دعم هذا المشروع عبر ❤️️ [GitHub](https://github.com/sponsors/trekhleb) أو ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
[الناس الذين يدعمون هذا المشروع](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
[الناس الذين يدعمون هذا المشروع](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -331,3 +331,6 @@ Nachfolgend finden Sie eine Liste einiger der am häufigsten verwendeten Big O-N
|
|||||||
> Du kannst dieses Projekt unterstützen über ❤️️ [GitHub](https://github.com/sponsors/trekhleb) or ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
> Du kannst dieses Projekt unterstützen über ❤️️ [GitHub](https://github.com/sponsors/trekhleb) or ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
[Leute, die dieses Projekt unterstützen](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
[Leute, die dieses Projekt unterstützen](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|
||||||
|
|||||||
@ -299,3 +299,5 @@ frente a diferentes tamaños de los datos de entrada.
|
|||||||
| **Shellsort** | n log(n) | depende de la secuencia de huecos | n (log(n))<sup>2</sup> | 1 | No | |
|
| **Shellsort** | n log(n) | depende de la secuencia de huecos | n (log(n))<sup>2</sup> | 1 | No | |
|
||||||
| **Ordenamiento por cuentas** | n + r | n + r | n + r | n + r | Si | r - mayor número en el arreglo |
|
| **Ordenamiento por cuentas** | n + r | n + r | n + r | n + r | Si | r - mayor número en el arreglo |
|
||||||
| **Ordenamiento Radix** | n \* k | n \* k | n \* k | n + k | Si | k - largo de la llave más larga |
|
| **Ordenamiento Radix** | n \* k | n \* k | n \* k | n + k | Si | k - largo de la llave más larga |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -293,3 +293,4 @@ comparaisons de performance suivant différentes tailles pour les données d'ent
|
|||||||
| **Tri Shell** | n log(n) | dépend du gap séquence | n (log(n))<sup>2</sup> | 1 | Non | |
|
| **Tri Shell** | n log(n) | dépend du gap séquence | n (log(n))<sup>2</sup> | 1 | Non | |
|
||||||
| **Tri Comptage** | n + r | n + r | n + r | n + r | Oui | r - le plus grand nombre dans la liste |
|
| **Tri Comptage** | n + r | n + r | n + r | n + r | Oui | r - le plus grand nombre dans la liste |
|
||||||
| **Tri Radix** | n \* k | n \* k | n \* k | n + k | Non | k - longueur du plus long index |
|
| **Tri Radix** | n \* k | n \* k | n \* k | n + k | Non | k - longueur du plus long index |
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -304,3 +304,5 @@ Di bawah ini adalah daftar dari beberapa notasi _Bog O_ yang sering digunakan da
|
|||||||
> Anda dapat mendukung proyek ini via ❤️️ [GitHub](https://github.com/sponsors/trekhleb) atau ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
> Anda dapat mendukung proyek ini via ❤️️ [GitHub](https://github.com/sponsors/trekhleb) atau ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
[Orang-orang yang mendukung proyek ini](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
[Orang-orang yang mendukung proyek ini](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -297,3 +297,5 @@ Nella tabella qua sotto ci sono riportate la lista delle notazioni Big O più us
|
|||||||
| **Shell sort** | n log(n) | dipende dagli spazi vuoti nella sequenza | n (log(n))<sup>2</sup> | 1 | No | |
|
| **Shell sort** | n log(n) | dipende dagli spazi vuoti nella sequenza | n (log(n))<sup>2</sup> | 1 | No | |
|
||||||
| **Counting sort** | n + r | n + r | n + r | n + r | Yes | r - numero più grande nell'array |
|
| **Counting sort** | n + r | n + r | n + r | n + r | Yes | r - numero più grande nell'array |
|
||||||
| **Radix sort** | n * k | n * k | n * k | n + k | Yes | k - lunghezza della chiave più grande |
|
| **Radix sort** | n * k | n * k | n * k | n + k | Yes | k - lunghezza della chiave più grande |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -296,3 +296,5 @@ npm test -- 'playground'
|
|||||||
| **Shell sort** | n log(n) | depends on gap sequence | n (log(n))<sup>2</sup> | 1 | No | |
|
| **Shell sort** | n log(n) | depends on gap sequence | n (log(n))<sup>2</sup> | 1 | No | |
|
||||||
| **Counting sort** | n + r | n + r | n + r | n + r | Yes | r - biggest number in array |
|
| **Counting sort** | n + r | n + r | n + r | n + r | Yes | r - biggest number in array |
|
||||||
| **Radix sort** | n * k | n * k | n * k | n + k | Yes | k - length of longest key |
|
| **Radix sort** | n * k | n * k | n * k | n + k | Yes | k - length of longest key |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -277,3 +277,5 @@ Source: [Big O Cheat Sheet](http://bigocheatsheet.com/).
|
|||||||
| **셸 정렬** | n log(n) | 간격 순서에 영향을 받습니다. | n (log(n))<sup>2</sup> | 1 | No | |
|
| **셸 정렬** | n log(n) | 간격 순서에 영향을 받습니다. | n (log(n))<sup>2</sup> | 1 | No | |
|
||||||
| **계수 정렬** | n + r | n + r | n + r | n + r | Yes | r - 배열내 가장 큰 수 |
|
| **계수 정렬** | n + r | n + r | n + r | n + r | Yes | r - 배열내 가장 큰 수 |
|
||||||
| **기수 정렬** | n * k | n * k | n * k | n + k | Yes | k - 키값의 최대 길이 |
|
| **기수 정렬** | n * k | n * k | n * k | n + k | Yes | k - 키값의 최대 길이 |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -343,3 +343,5 @@ Below is the list of some of the most used Big O notations and their performance
|
|||||||
> You may support this project via ❤️️ [GitHub](https://github.com/sponsors/trekhleb) or ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
> You may support this project via ❤️️ [GitHub](https://github.com/sponsors/trekhleb) or ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
[Folks who are backing this project](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
[Folks who are backing this project](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -289,3 +289,5 @@ Poniżej umieszczamy listę najbardziej używanych Big O notacji i ich porównan
|
|||||||
| **Sortowanie Shella** | n log(n) | zależy od luki w układzie | n (log(n))<sup>2</sup> | 1 | No | |
|
| **Sortowanie Shella** | n log(n) | zależy od luki w układzie | n (log(n))<sup>2</sup> | 1 | No | |
|
||||||
| **Sortowanie przez zliczanie** | n + r | n + r | n + r | n + r | Yes | r - największy numer w tablicy|
|
| **Sortowanie przez zliczanie** | n + r | n + r | n + r | n + r | Yes | r - największy numer w tablicy|
|
||||||
| **Sortowanie Radix** | n * k | n * k | n * k | n + k | Yes | k -długość najdłuższego klucza |
|
| **Sortowanie Radix** | n * k | n * k | n * k | n + k | Yes | k -długość najdłuższego klucza |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -290,3 +290,5 @@ Abaixo está a lista de algumas das notações Big O mais usadas e suas compara
|
|||||||
| **Shell sort** | n log(n) | depende da sequência de lacunas | n (log(n))<sup>2</sup> | 1 | Não | |
|
| **Shell sort** | n log(n) | depende da sequência de lacunas | n (log(n))<sup>2</sup> | 1 | Não | |
|
||||||
| **Counting sort** | n + r | n + r | n + r | n + r | Sim | r - maior número na matriz |
|
| **Counting sort** | n + r | n + r | n + r | n + r | Sim | r - maior número na matriz |
|
||||||
| **Radix sort** | n * k | n * k | n * k | n + k | Sim | k - comprimento da chave mais longa |
|
| **Radix sort** | n * k | n * k | n * k | n + k | Sim | k - comprimento da chave mais longa |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -295,3 +295,5 @@ npm test -- 'playground'
|
|||||||
| **Сортировка Шелла** | n log(n) | зависит от выбранных шагов | n (log(n))<sup>2</sup> | 1 | Нет | |
|
| **Сортировка Шелла** | n log(n) | зависит от выбранных шагов | n (log(n))<sup>2</sup> | 1 | Нет | |
|
||||||
| **Сортировка подсчётом** | n + r | n + r | n + r | n + r | Да | r — наибольшее число в массиве |
|
| **Сортировка подсчётом** | n + r | n + r | n + r | n + r | Да | r — наибольшее число в массиве |
|
||||||
| **Поразрядная сортировка** | n * k | n * k | n * k | n + k | Да | k — длина самого длинного ключа |
|
| **Поразрядная сортировка** | n * k | n * k | n * k | n + k | Да | k — длина самого длинного ключа |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -315,3 +315,5 @@ Altta Big O notations ve farklı input boyutlarına karşın yapılmış perform
|
|||||||
## Projeyi Destekleme
|
## Projeyi Destekleme
|
||||||
|
|
||||||
Bu projeyi buradan destekleyebilirsiniz ❤️️ [GitHub](https://github.com/sponsors/trekhleb) veya ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
Bu projeyi buradan destekleyebilirsiniz ❤️️ [GitHub](https://github.com/sponsors/trekhleb) veya ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -305,3 +305,5 @@ npm test -- 'playground'
|
|||||||
> Ви можете підтримати цей проект через ❤️️ [GitHub](https://github.com/sponsors/trekhleb) або ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
> Ви можете підтримати цей проект через ❤️️ [GitHub](https://github.com/sponsors/trekhleb) або ❤️️ [Patreon](https://www.patreon.com/trekhleb).
|
||||||
|
|
||||||
[Люди, які підтримують цей проект](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
[Люди, які підтримують цей проект](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -292,3 +292,5 @@ npm test -- 'playground'
|
|||||||
| **希尔排序** | n log(n) | 取决于差距序列 | n (log(n))^2 | 1 | No | |
|
| **希尔排序** | n log(n) | 取决于差距序列 | n (log(n))^2 | 1 | No | |
|
||||||
| **计数排序** | n + r | n + r | n + r | n + r | Yes | r - 数组里最大的数 |
|
| **计数排序** | n + r | n + r | n + r | n + r | Yes | r - 数组里最大的数 |
|
||||||
| **基数排序** | n * k | n * k | n * k | n + k | Yes | k - 最长 key 的升序 |
|
| **基数排序** | n * k | n * k | n * k | n + k | Yes | k - 最长 key 的升序 |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
@ -222,3 +222,5 @@ npm test -- 'playground'
|
|||||||
| **合併排序** | n log(n) | n log(n) | n log(n) | n | Yes |
|
| **合併排序** | n log(n) | n log(n) | n log(n) | n | Yes |
|
||||||
| **快速排序** | n log(n) | n log(n) | n^2 | log(n) | No |
|
| **快速排序** | n log(n) | n log(n) | n^2 | log(n) | No |
|
||||||
| **希爾排序** | n log(n) | 由gap sequence決定 | n (log(n))^2 | 1 | No |
|
| **希爾排序** | n log(n) | 由gap sequence決定 | n (log(n))^2 | 1 | No |
|
||||||
|
|
||||||
|
> ℹ️ Some more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user