mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-09-20 07:43:04 +08:00
Merge branch 'master' into master
This commit is contained in:
Oleksii Trekhleb
GitHub
commit
075dab1d24
@ -12,9 +12,10 @@
|
||||
"arrow-body-style": "off",
|
||||
"no-loop-func": "off"
|
||||
},
|
||||
"ignorePatterns": ["*.md", "*.png", "*.jpeg", "*.jpg"],
|
||||
"settings": {
|
||||
"react": {
|
||||
"version": "latest"
|
||||
"version": "18.2.0"
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
2
.github/workflows/CI.yml
vendored
2
.github/workflows/CI.yml
vendored
@ -11,7 +11,7 @@ jobs:
|
||||
runs-on: ubuntu-latest
|
||||
strategy:
|
||||
matrix:
|
||||
node-version: [ 14.x ]
|
||||
node-version: [ 16.x ]
|
||||
|
||||
steps:
|
||||
- name: Checkout repository
|
||||
|
||||
18
BACKERS.md
18
BACKERS.md
@ -14,6 +14,24 @@
|
||||
|
||||
`null`
|
||||
|
||||
<!--
|
||||
<table>
|
||||
<tr>
|
||||
<td align="center">
|
||||
<a href="[PROFILE_URL]">
|
||||
<img
|
||||
src="[PROFILE_IMG_SRC]"
|
||||
width="50"
|
||||
height="50"
|
||||
/>
|
||||
</a>
|
||||
<br />
|
||||
<a href="[PROFILE_URL]">[PROFILE_NAME]</a>
|
||||
</td>
|
||||
</tr>
|
||||
</table>
|
||||
-->
|
||||
|
||||
<!--
|
||||
<ul>
|
||||
<li>
|
||||
|
||||
@ -23,7 +23,8 @@ _اقرأ هذا في لغات أخرى:_
|
||||
[_Türk_](README.tr-TR.md),
|
||||
[_Italiana_](README.it-IT.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
☝ ملاحضة هذا المشروع مخصص للاستخدام لأغراض التعلم والبحث
|
||||
فقط ، و ** ليست ** معدة للاستخدام في **الإنتاج**
|
||||
|
||||
@ -24,7 +24,8 @@ _Lies dies in anderen Sprachen:_
|
||||
[_Italiana_](README.it-IT.md),
|
||||
[_Bahasa Indonesia_](README.id-ID.md),
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md)
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
_☝ Beachte, dass dieses Projekt nur für Lern- und Forschungszwecke gedacht ist und **nicht** für den produktiven Einsatz verwendet werden soll_
|
||||
|
||||
|
||||
@ -25,7 +25,8 @@ _Léelo en otros idiomas:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Nótese que este proyecto está pensado con fines de aprendizaje e investigación,
|
||||
y **no** para ser usado en producción.*
|
||||
|
||||
@ -26,7 +26,8 @@ _Lisez ceci dans d'autres langues:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## Data Structures
|
||||
|
||||
|
||||
@ -23,7 +23,8 @@ _Baca ini dalam bahasa yang lain:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
_☝ Perhatikan bahwa proyek ini hanya dimaksudkan untuk tujuan pembelajaran dan riset, dan **tidak** dimaksudkan untuk digunakan sebagai produksi._
|
||||
|
||||
|
||||
@ -22,7 +22,8 @@ _Leggilo in altre lingue:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Si noti che questo progetto è destinato ad essere utilizzato solo per l'apprendimento e la ricerca e non è destinato ad essere utilizzato per il commercio.*
|
||||
|
||||
|
||||
@ -25,7 +25,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## データ構造
|
||||
|
||||
|
||||
@ -24,7 +24,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## 자료 구조
|
||||
|
||||
|
||||
23
README.md
23
README.md
@ -1,14 +1,17 @@
|
||||
# JavaScript Algorithms and Data Structures
|
||||
|
||||
> 🇺🇦 UKRAINE [IS BEING ATTACKED](https://war.ukraine.ua/) BY RUSSIAN ARMY. CIVILIANS ARE GETTING KILLED. RESIDENTIAL AREAS ARE GETTING BOMBED.
|
||||
> - Help Ukraine via [National Bank of Ukraine](https://bank.gov.ua/en/news/all/natsionalniy-bank-vidkriv-spetsrahunok-dlya-zboru-koshtiv-na-potrebi-armiyi)
|
||||
> - Help Ukraine via [SaveLife](https://savelife.in.ua/en/donate-en/) fund
|
||||
> - Help Ukraine via:
|
||||
> - [Serhiy Prytula Charity Foundation](https://prytulafoundation.org/en/)
|
||||
> - [Come Back Alive Charity Foundation](https://savelife.in.ua/en/donate-en/)
|
||||
> - [National Bank of Ukraine](https://bank.gov.ua/en/news/all/natsionalniy-bank-vidkriv-spetsrahunok-dlya-zboru-koshtiv-na-potrebi-armiyi)
|
||||
> - More info on [war.ukraine.ua](https://war.ukraine.ua/) and [MFA of Ukraine](https://twitter.com/MFA_Ukraine)
|
||||
|
||||
<hr/>
|
||||
|
||||
[](https://github.com/trekhleb/javascript-algorithms/actions?query=workflow%3ACI+branch%3Amaster)
|
||||
[](https://codecov.io/gh/trekhleb/javascript-algorithms)
|
||||
|
||||
|
||||
This repository contains JavaScript based examples of many
|
||||
popular algorithms and data structures.
|
||||
@ -33,7 +36,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Note that this project is meant to be used for learning and researching purposes
|
||||
only, and it is **not** meant to be used for production.*
|
||||
@ -45,6 +49,8 @@ be accessed and modified efficiently. More precisely, a data structure is a coll
|
||||
values, the relationships among them, and the functions or operations that can be applied to
|
||||
the data.
|
||||
|
||||
Remember that each data has its own trade-offs. And you need to pay attention more to why you're choosing a certain data structure than to how to implement it.
|
||||
|
||||
`B` - Beginner, `A` - Advanced
|
||||
|
||||
* `B` [Linked List](src/data-structures/linked-list)
|
||||
@ -133,6 +139,7 @@ a set of rules that precisely define a sequence of operations.
|
||||
* `B` [Shellsort](src/algorithms/sorting/shell-sort)
|
||||
* `B` [Counting Sort](src/algorithms/sorting/counting-sort)
|
||||
* `B` [Radix Sort](src/algorithms/sorting/radix-sort)
|
||||
* `B` [Bucket Sort](src/algorithms/sorting/bucket-sort)
|
||||
* **Linked Lists**
|
||||
* `B` [Straight Traversal](src/algorithms/linked-list/traversal)
|
||||
* `B` [Reverse Traversal](src/algorithms/linked-list/reverse-traversal)
|
||||
@ -287,7 +294,7 @@ rm -rf ./node_modules
|
||||
npm i
|
||||
```
|
||||
|
||||
Also make sure that you're using a correct Node version (`>=14.16.0`). If you're using [nvm](https://github.com/nvm-sh/nvm) for Node version management you may run `nvm use` from the root folder of the project and the correct version will be picked up.
|
||||
Also make sure that you're using a correct Node version (`>=16`). If you're using [nvm](https://github.com/nvm-sh/nvm) for Node version management you may run `nvm use` from the root folder of the project and the correct version will be picked up.
|
||||
|
||||
**Playground**
|
||||
|
||||
@ -361,10 +368,10 @@ 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).
|
||||
|
||||
[Folks who are backing this project](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 0`
|
||||
|
||||
> ℹ️ A few more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||
[Folks who are backing this project](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
||||
|
||||
## Author
|
||||
|
||||
- [@trekhleb](https://trekhleb.dev)
|
||||
[@trekhleb](https://trekhleb.dev)
|
||||
|
||||
A few more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||
|
||||
@ -26,7 +26,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## Struktury Danych
|
||||
|
||||
|
||||
@ -26,7 +26,8 @@ _Leia isto em outros idiomas:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## Estrutura de Dados
|
||||
|
||||
|
||||
@ -23,7 +23,8 @@ _Читать на других языках:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Замечание: этот репозиторий предназначен для учебно-исследовательских целей (**не** для использования в продакшн-системах).*
|
||||
|
||||
|
||||
@ -23,7 +23,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Not, bu proje araştırma ve öğrenme amacı ile yapılmış
|
||||
olup üretim için **yapılmamıştır**.*
|
||||
|
||||
@ -23,7 +23,8 @@ _Вивчення матеріалу на інших мовах:_
|
||||
[_Bahasa Indonesia_](README.id-ID.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*☝ Зверніть увагу! Даний проект призначений лише для навчальних та дослідницьких цілей, і він **не** призначений для виробництва (продакшн).*
|
||||
|
||||
|
||||
358
README.uz-UZ.md
Normal file
358
README.uz-UZ.md
Normal file
@ -0,0 +1,358 @@
|
||||
# JavaScript algoritmlari va ma'lumotlar tuzilmalari
|
||||
|
||||
[](https://github.com/trekhleb/javascript-algorithms/actions?query=workflow%3ACI+branch%3Amaster)
|
||||
[](https://codecov.io/gh/trekhleb/javascript-algorithms)
|
||||
|
||||
|
||||
Bu repozitoriyada JavaScript-ga asoslangan ko'plab mashhur algoritmlar
|
||||
va ma'lumotlar tuzilmalarining namunalari mavjud.
|
||||
|
||||
Har bir algoritm va ma'lumotlar tuzilmasining alohida README fayli
|
||||
bo'lib, unda tegishli tushuntirishlar va qo'shimcha o'qish uchun
|
||||
havolalar (shu jumladan YouTube videolariga ham havolalar) mavjud.
|
||||
|
||||
_Read this in other languages:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_日本語_](README.ja-JP.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_Türkçe_](README.tr-TR.md),
|
||||
[_Italiana_](README.it-IT.md),
|
||||
[_Bahasa Indonesia_](README.id-ID.md),
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
Yodda tuting, bu loyiha faqat o'quv va tadqiqot maqsadida ishlatilishi
|
||||
uchun mo'ljallangan va ishlab chiqarishda ishlatilishi **mumkin emas**.
|
||||
|
||||
## Ma'lumotlar tuzilmalari
|
||||
|
||||
Ma'lumotlar tuzilmasi - bu kompyuterda ma'lumotlarni samarali tarzda
|
||||
olish va o'zgartirish uchun ularni tashkil etish va saqlashning ma'lum
|
||||
bir usuli. Ayniqsa, ma'lumotlar tuzilmasi ma'lumot qiymatlarining
|
||||
to'plami, ular orasidagi munosabatlar va ma'lumotlarga qo'llanilishi
|
||||
mumkin bo'lgan funksiyalar yoki operatsiyalardir.
|
||||
|
||||
`B` - Boshlang'ich, `A` - Ilg'or
|
||||
|
||||
- `B` [Bog'langan ro'yxat](src/data-structures/linked-list)
|
||||
- `B` [Ikki marta bog'langan ro'yxat](src/data-structures/doubly-linked-list)
|
||||
- `B` [Navbat](src/data-structures/queue)
|
||||
- `B` [Stek](src/data-structures/stack)
|
||||
- `B` [Hash jadvali](src/data-structures/hash-table)
|
||||
- `B` [Heap](src/data-structures/heap) - maksimal va minimal heap versiyalari
|
||||
- `B` [Ustuvor navbat](src/data-structures/priority-queue)
|
||||
- `A` [Trie](src/data-structures/trie)
|
||||
- `A` [Daraxt](src/data-structures/tree)
|
||||
- `A` [Ikkilik qidiruv daraxt](src/data-structures/tree/binary-search-tree)
|
||||
- `A` [AVL daraxt](src/data-structures/tree/avl-tree)
|
||||
- `A` [Qizil-qora daraxt](src/data-structures/tree/red-black-tree)
|
||||
- `A` [Segment daraxt](src/data-structures/tree/segment-tree) - min/max/sum diapazon so'rovlari bilan misollar
|
||||
- `A` [Fenwick daraxt](src/data-structures/tree/fenwick-tree) (ikkilik indeksli daraxt)
|
||||
- `A` [Graf](src/data-structures/graph) (yo'naltirilgan hamda yo'naltirilmagan)
|
||||
- `A` [Ajratilgan to'plam](src/data-structures/disjoint-set) - union-find ma'lumotlar strukturasi yoki merge-find to'plami
|
||||
- `A` [Bloom filtri](src/data-structures/bloom-filter)
|
||||
- `A` [LRU keshi](src/data-structures/lru-cache/) - Eng kam ishlatilgan (LRU) keshi
|
||||
|
||||
## Algoritmlar
|
||||
|
||||
Algoritm muammolar sinfini qanday hal qilishning aniq spetsifikatsiyasi. Bu operatsiyalar ketma-ketligini aniqlaydigan qoidalar to'plami.
|
||||
|
||||
`B` - Boshlang'ich, `A` - Ilg'or
|
||||
|
||||
### Mavzu bo'yicha algoritmlar
|
||||
|
||||
- **Matematika**
|
||||
- `B` [Bit manipulatsiyasi](src/algorithms/math/bits) - bitlarni qo'yish/olish/yangilash/tozalash, ikkilikka ko'paytirish/bo'lish, manfiy qilish va hokazo.
|
||||
- `B` [Ikkilik suzuvchi nuqta](src/algorithms/math/binary-floating-point) - suzuvchi nuqtali sonlarning ikkilik tasviri.
|
||||
- `B` [Faktorial](src/algorithms/math/factorial)
|
||||
- `B` [Fibonachchi raqam](src/algorithms/math/fibonacci) - klassik va yopiq shakldagi versiyalar
|
||||
- `B` [Asosiy omillar](src/algorithms/math/prime-factors) - tub omillarni topish va ularni Xardi-Ramanujan teoremasi yordamida sanash
|
||||
- `B` [Birlamchilik testi](src/algorithms/math/primality-test) (sinov bo'linish usuli)
|
||||
- `B` [Evklid algoritmi](src/algorithms/math/euclidean-algorithm) - eng katta umumiy bo'luvchini (EKUB) hisoblash
|
||||
- `B` [Eng kichik umumiy karrali](src/algorithms/math/least-common-multiple) (EKUK)
|
||||
- `B` [Eratosfen elagi](src/algorithms/math/sieve-of-eratosthenes) - berilgan chegaragacha barcha tub sonlarni topish
|
||||
- `B` [Ikkining darajasimi](src/algorithms/math/is-power-of-two) - raqamning ikkining darajasi ekanligini tekshirish (sodda va bitli algoritmlar)
|
||||
- `B` [Paskal uchburchagi](src/algorithms/math/pascal-triangle)
|
||||
- `B` [Kompleks sonlar](src/algorithms/math/complex-number) - kompleks sonlar va ular bilan asosiy amallar
|
||||
- `B` [Radian & Daraja](src/algorithms/math/radian) - radianlarni darajaga va orqaga aylantirish
|
||||
- `B` [Tez ko'tarish](src/algorithms/math/fast-powering)
|
||||
- `B` [Horner metodi](src/algorithms/math/horner-method) - polinomlarni baholash
|
||||
- `B` [Matritsalar](src/algorithms/math/matrix) - matritsalar va asosiy matritsa operatsiyalari (ko'paytirish, transpozitsiya va boshqalar).
|
||||
- `B` [Evklid masofasi](src/algorithms/math/euclidean-distance) - ikki nuqta/vektor/matritsa orasidagi masofa
|
||||
- `A` [Butun sonlarni bo'lish](src/algorithms/math/integer-partition)
|
||||
- `A` [Kvadrat ildiz](src/algorithms/math/square-root) - Nyuton metodi
|
||||
- `A` [Liu Hui π algoritmi](src/algorithms/math/liu-hui) - N-gonlarga asoslangan π ning taxminiy hisoblari
|
||||
- `A` [Diskret Furye transformatsiyasi](src/algorithms/math/fourier-transform) - vaqt funksiyasini (signalni) uni tashkil etuvchi chastotalarga ajratish
|
||||
- **Sets**
|
||||
- `B` [Karteziya maxsuloti](src/algorithms/sets/cartesian-product) - bir nechta to'plamlarning ko'paytmasi
|
||||
- `B` [Fisher–Yates Shuffle](src/algorithms/sets/fisher-yates) - chekli ketma-ketlikni tasodifiy almashtirish
|
||||
- `A` [Power Set](src/algorithms/sets/power-set) - to'plamning barcha kichik to'plamlari (bitwise, backtracking va kaskadli echimlar)
|
||||
- `A` [Permutatsiyalar](src/algorithms/sets/permutations) (takroriyalash bilan va takroriyalashsiz)
|
||||
- `A` [Kombinatsiyalar](src/algorithms/sets/combinations) (takroriyalash bilan va takroriyalashsiz)
|
||||
- `A` [Eng uzun umumiy ketma-ketlik](src/algorithms/sets/longest-common-subsequence) (LCS)
|
||||
- `A` [Eng uzun ortib boruvchi ketma-ketlik](src/algorithms/sets/longest-increasing-subsequence)
|
||||
- `A` [Eng qisqa umumiy ketma-ketlik](src/algorithms/sets/shortest-common-supersequence) (SCS)
|
||||
- `A` [Knapsack muammosi](src/algorithms/sets/knapsack-problem) - "0/1" va "Bir-biriga bog'lanmagan"
|
||||
- `A` [Maksimal kichik massiv](src/algorithms/sets/maximum-subarray) - Toʻliq kuch va dinamik dasturlash (Kadane usuli) versiyalari
|
||||
- `A` [Kombinatsiya yig'indisi](src/algorithms/sets/combination-sum) - ma'lum summani tashkil etuvchi barcha kombinatsiyalarni topish
|
||||
- **Stringlar**
|
||||
- `B` [Hamming masofasi](src/algorithms/string/hamming-distance) - belgilarning bir-biridan farq qiladigan pozitsiyalar soni
|
||||
- `B` [Palindrom](src/algorithms/string/palindrome) - satrning teskari tomoni ham bir xil ekanligini tekshirish
|
||||
- `A` [Levenshtein masofasi](src/algorithms/string/levenshtein-distance) - ikki ketma-ketlik o'rtasidagi minimal tahrirlash masofasi
|
||||
- `A` [Knuth–Morris–Pratt Algoritmi](src/algorithms/string/knuth-morris-pratt) (KMP Algoritmi) - kichik qatorlarni qidirish (mosh keluvchi naqshni qidirish)
|
||||
- `A` [Z Algoritmi](src/algorithms/string/z-algorithm) - kichik qatorlarni qidirish (mosh keluvchi naqshni qidirish)
|
||||
- `A` [Rabin Karp Algoritmi](src/algorithms/string/rabin-karp) - kichik qatorlarni qidirish
|
||||
- `A` [Eng uzun umumiy kichik matn](src/algorithms/string/longest-common-substring)
|
||||
- `A` [Regulyar ifoda moslashuvi](src/algorithms/string/regular-expression-matching) (RegEx)
|
||||
- **Qidiruvlar**
|
||||
- `B` [Linear qidirish](src/algorithms/search/linear-search)
|
||||
- `B` [Jump qidirish](src/algorithms/search/jump-search) (yoki Blok qidirish) - saralangan qatorda qidirish
|
||||
- `B` [Ikkilik qidirish](src/algorithms/search/binary-search) - saralangan qatorda qidirish
|
||||
- `B` [Interpolatsiya qidirish](src/algorithms/search/interpolation-search) - bir tekis taqsimlangan saralangan qatorda qidirish
|
||||
- **Tartiblash**
|
||||
- `B` [Pufakcha tartiblash](src/algorithms/sorting/bubble-sort)
|
||||
- `B` [Tanlash tartibi](src/algorithms/sorting/selection-sort)
|
||||
- `B` [Kiritish tartibi](src/algorithms/sorting/insertion-sort)
|
||||
- `B` [Heap tartibi](src/algorithms/sorting/heap-sort)
|
||||
- `B` [Birlashtirish tartibi](src/algorithms/sorting/merge-sort)
|
||||
- `B` [Tezkor saralash](src/algorithms/sorting/quick-sort) - joyida va joyida bo'lmagan amalga oshirish
|
||||
- `B` [Shell tartiblash](src/algorithms/sorting/shell-sort)
|
||||
- `B` [Sanash tartibi](src/algorithms/sorting/counting-sort)
|
||||
- `B` [Radiksli tartiblash](src/algorithms/sorting/radix-sort)
|
||||
- `B` [Bucket tartiblash](src/algorithms/sorting/bucket-sort)
|
||||
- **Bog'langan ro'yhatlar**
|
||||
- `B` [To'g'ri traversal](src/algorithms/linked-list/traversal)
|
||||
- `B` [Teskari traversal](src/algorithms/linked-list/reverse-traversal)
|
||||
- **Daraxtlar**
|
||||
- `B` [Birinchi-pastga qarab qidirish](src/algorithms/tree/depth-first-search) (Depth-First Search)
|
||||
- `B` [Birinchi-yonga qarab qidirish](src/algorithms/tree/breadth-first-search) (Breadth-First Search)
|
||||
- **Grafiklar**
|
||||
- `B` [Birinchi-pastga qarab qidirish](src/algorithms/graph/depth-first-search) (Depth-First Search)
|
||||
- `B` [Birinchi-yonga qarab qidirish](src/algorithms/graph/breadth-first-search) (Breadth-First Search)
|
||||
- `B` [Kruskal Algoritmi](src/algorithms/graph/kruskal) - og'irlikdagi yo'naltirilmagan grafik uchun Minimal kengayuvchi daraxtni (MST) topish
|
||||
- `A` [Dijkstra Algoritmi](src/algorithms/graph/dijkstra) - grafikning bir cho'qqisidan qolgan barcha nuqtalarga eng qisqa yo'llarni topish
|
||||
- `A` [Bellman-Ford Algoritmi](src/algorithms/graph/bellman-ford) - grafikning bir cho'qqisidan qolgan barcha nuqtalarga eng qisqa yo'llarni topish
|
||||
- `A` [Floyd-Warshall Algoritmi](src/algorithms/graph/floyd-warshall) - grafikning barcha uchlari orasidagi eng qisqa masofalarni topish
|
||||
- `A` [Siklni aniqlash](src/algorithms/graph/detect-cycle) - yo'naltirilgan va yo'naltirilmagan grafiklar uchun (DFS va Disjoint Set-ga asoslangan versiyalar)
|
||||
- `A` [Prim Algoritmi](src/algorithms/graph/prim) - og'irlikdagi yo'naltirilmagan grafik uchun Minimal kengayuvchi daraxtni (MST) topish
|
||||
- `A` [Topologik saralash](src/algorithms/graph/topological-sorting) - DFS metodi
|
||||
- `A` [Artikulyatsiya nuqtalari](src/algorithms/graph/articulation-points) - Tarjan algoritmi (DFS asosida)
|
||||
- `A` [Ko'priklar](src/algorithms/graph/bridges) - DFS asosidagi algoritm
|
||||
- `A` [Eyler yo'li va Eyler sxemasi](src/algorithms/graph/eulerian-path) - Fleury algoritmi - Har bir chekkaga bir marta tashrif buyurish
|
||||
- `A` [Gamilton sikli](src/algorithms/graph/hamiltonian-cycle) - Har bir cho'qqiga bir marta tashrif buyurish
|
||||
- `A` [Kuchli bog'langan komponentlar](src/algorithms/graph/strongly-connected-components) - Kosaraju algoritmi
|
||||
- `A` [Sayohatchi sotuvchi muammosi](src/algorithms/graph/travelling-salesman) - har bir shaharga tashrif buyuradigan va kelib chiqqan shaharga qaytib keladigan eng qisqa yo'l
|
||||
- **Kriptografiya**
|
||||
- `B` [Polynomial Hash](src/algorithms/cryptography/polynomial-hash) - polinomga asoslangan hash funktsiyasi
|
||||
- `B` [Rail Fence Cipher](src/algorithms/cryptography/rail-fence-cipher) - xabarlarni kodlash uchun transpozitsiya shifrlash algoritmi
|
||||
- `B` [Caesar Cipher](src/algorithms/cryptography/caesar-cipher) - oddiy almashtirish shifridir
|
||||
- `B` [Hill Cipher](src/algorithms/cryptography/hill-cipher) - chiziqli algebraga asoslangan almashtirish shifri
|
||||
- **Machine Learning**
|
||||
- `B` [NanoNeuron](https://github.com/trekhleb/nano-neuron) - Mashinalar aslida qanday o'rganishi mumkinligini ko'rsatadigan 7 ta oddiy JS funksiyasi (forward/backward tarqalish)
|
||||
- `B` [k-NN](src/algorithms/ml/knn) - eng yaqin qo'shnilarni tasniflash algoritmi
|
||||
- `B` [k-Means](src/algorithms/ml/k-means) - k-Means kalsterlash algoritmi
|
||||
- **Tasvirga ishlov berish**
|
||||
- `B` [Seam Carving](src/algorithms/image-processing/seam-carving) - kontentga moslashuvchan rasm o'lchamini o'zgartirish algoritmi
|
||||
- **Statistikalar**
|
||||
- `B` [Weighted Random](src/algorithms/statistics/weighted-random) - elementlarning og'irligi asosida ro'yxatdan tasodifiy elementni tanlash
|
||||
- **Evolyutsion algoritmlar**
|
||||
- `A` [Genetik algoritm](https://github.com/trekhleb/self-parking-car-evolution) - avtoturargohni o'rgatish uchun genetik algoritm qanday qo'llanilishiga misol.
|
||||
- **Kategoriyasiz**
|
||||
- `B` [Xanoy minorasi](src/algorithms/uncategorized/hanoi-tower)
|
||||
- `B` [Kvadrat matritsaning aylanishi](src/algorithms/uncategorized/square-matrix-rotation) - joyidagi algoritm
|
||||
- `B` [Sakrash o'yini](src/algorithms/uncategorized/jump-game) - orqaga qaytish, dinamik dasturlash (yuqoridan pastga + pastdan yuqoriga) va ochko'z misollar
|
||||
- `B` [Noyob yo'llar](src/algorithms/uncategorized/unique-paths) - orqaga qaytish, dinamik dasturlash va Paskal uchburchagiga asoslangan misolla
|
||||
- `B` [Yomg'ir teraslari](src/algorithms/uncategorized/rain-terraces) - yomg'ir suvini ushlab turish muammosi (dinamik dasturlash va qo'pol kuch versiyalari)
|
||||
- `B` [Rekursiv zinapoya](src/algorithms/uncategorized/recursive-staircase) - yuqoriga chiqish yo'llari sonini hisoblash (4 ta echim)
|
||||
- `B` [Aksiyalarni sotib olish va sotish uchun eng yaxshi vaqt](src/algorithms/uncategorized/best-time-to-buy-sell-stocks) - bo'linib-zabt etish va bir marta o'tish misollari
|
||||
- `A` [N-Queens Muommosi](src/algorithms/uncategorized/n-queens)
|
||||
- `A` [Ritsar sayohati](src/algorithms/uncategorized/knight-tour)
|
||||
|
||||
### Paradigma bo'yicha algoritmlar
|
||||
|
||||
Algorithmic paradigm - bu algoritmlar sinfini loyihalashtirishga asos bo'lib xizmat qiladigan umumiy usul yoki yondashuv. Bu algoritm tushunchasidan yuqori darajadagi abstraktsiya bo'lib, algoritm kompyuter dasturi tushunchasidan yuqori darajadagi abstraktsiya bo'lgani kabi.
|
||||
|
||||
- **Brute Force** - barcha imkoniyatlarni ko'rib chiqib va eng yaxshi echimni tanlash
|
||||
- `B` [Chiziqli qidirish](src/algorithms/search/linear-search)
|
||||
- `B` [Yomg'irli teraslar](src/algorithms/uncategorized/rain-terraces) - yomg'ir suvini to'plash muammosi
|
||||
- `B` [Rekursiv zinapoya](src/algorithms/uncategorized/recursive-staircase) - cho'qqiga chiqish yo'llari sonini hisoblash
|
||||
- `A` [Maksimal kichik massiv](src/algorithms/sets/maximum-subarray)
|
||||
- `A` [Sayohatchi sotuvchi muammosi](src/algorithms/graph/travelling-salesman) - har bir shaharga tashrif buyuradigan va kelib chiqqan shaharga qaytib keladigan eng qisqa yo'l
|
||||
- `A` [Diskret Furye transformatsiyasi](src/algorithms/math/fourier-transform) - vaqt funksiyasini (signalni) uni tashkil etuvchi chastotalarga ajratish
|
||||
- **Greedy** - kelajakni o'ylamasdan, hozirgi vaqtda eng yaxshi variantni tanlash
|
||||
- `B` [Sakrash o'yini](src/algorithms/uncategorized/jump-game)
|
||||
- `A` [Bog'lanmagan yukxalta muammosi](src/algorithms/sets/knapsack-problem)
|
||||
- `A` [Dijkstra Algoritmi](src/algorithms/graph/dijkstra) - grafikning bir cho'qqisidan qolgan barcha nuqtalarga eng qisqa yo'llarni topish
|
||||
- `A` [Prim Algoritmi](src/algorithms/graph/prim) - og'irlikdagi yo'naltirilmagan grafik uchun Minimal kengayuvchi daraxtni (MST) topish
|
||||
- `A` [Kruskal Algoritmi](src/algorithms/graph/kruskal) - og'irlikdagi yo'naltirilmagan grafik uchun Minimal kengayuvchi daraxtni (MST) topish
|
||||
- **Divide and Conquer** - muammoni kichikroq qismlarga bo'lib va keyin bu qismlarni hal qilish
|
||||
|
||||
- `B` [Ikkilik qidiruv](src/algorithms/search/binary-search)
|
||||
- `B` [Xanoy minorasi](src/algorithms/uncategorized/hanoi-tower)
|
||||
- `B` [Paskal uchburchagi](src/algorithms/math/pascal-triangle)
|
||||
- `B` [Evklid Algoritmi](src/algorithms/math/euclidean-algorithm) - eng katta umumiy bo'luvchini (EKUB) hisoblash
|
||||
- `B` [Birlashtirish tartibi](src/algorithms/sorting/merge-sort)
|
||||
- `B` [Tezkor saralash](src/algorithms/sorting/quick-sort)
|
||||
- `B` [Birinchi-pastga qarab qidirish daraxti](src/algorithms/tree/depth-first-search) (DFS)
|
||||
- `B` [Birinchi-pastga qarab qidirish grafigi](src/algorithms/graph/depth-first-search) (DFS)
|
||||
- `B` [Matritsalar](src/algorithms/math/matrix) - turli shakldagi matritsalarni hosil qilish va kesib o'tish
|
||||
- `B` [Sakrash o'yini](src/algorithms/uncategorized/jump-game)
|
||||
- `B` [Tez ko'tarish](src/algorithms/math/fast-powering)
|
||||
- `B` [Aksiyalarni sotib olish va sotish uchun eng yaxshi vaqt](src/algorithms/uncategorized/best-time-to-buy-sell-stocks) - bo'linib-zabt etish va bir marta o'tish misollari
|
||||
- `A` [Permutatsiyalar](src/algorithms/sets/permutations) (takroriyalash bilan va takroriyalashsiz)
|
||||
- `A` [Kombinatsiyalar](src/algorithms/sets/combinations) (takroriyalash bilan va takroriyalashsiz)
|
||||
- `A` [Maksimal kichik massiv](src/algorithms/sets/maximum-subarray)
|
||||
|
||||
- **Dinamik dasturlash** - ilgari topilgan kichik yechimlar yordamida yechim yaratish
|
||||
- `B` [Fibonachchi raqam](src/algorithms/math/fibonacci)
|
||||
- `B` [Sakrash o'yini](src/algorithms/uncategorized/jump-game)
|
||||
- `B` [Noyob yo'llar](src/algorithms/uncategorized/unique-paths)
|
||||
- `B` [Yomg'ir teraslari](src/algorithms/uncategorized/rain-terraces) - yomg'ir suvini to'plash muammosi
|
||||
- `B` [Recursive Staircase](src/algorithms/uncategorized/recursive-staircase) - count the number of ways to reach to the top
|
||||
- `B` [Seam Carving](src/algorithms/image-processing/seam-carving) - kontentga moslashuvchan rasm o'lchamini o'zgartirish algoritmi
|
||||
- `A` [Levenshtein masofasi](src/algorithms/string/levenshtein-distance) - ikki ketma-ketlik o'rtasidagi minimal tahrirlash masofasi
|
||||
- `A` [Eng uzun umumiy ketma-ketlik](src/algorithms/sets/longest-common-subsequence) (LCS)
|
||||
- `A` [Eng uzun umumiy kichik matn](src/algorithms/string/longest-common-substring)
|
||||
- `A` [Eng uzun ortib boruvchi ketma-ketlik](src/algorithms/sets/longest-increasing-subsequence)
|
||||
- `A` [Eng qisqa umumiy ketma-ketlik](src/algorithms/sets/shortest-common-supersequence)
|
||||
- `A` [0/1 Knapsak muommosi](src/algorithms/sets/knapsack-problem)
|
||||
- `A` [Butun sonlarni bo'lish](src/algorithms/math/integer-partition)
|
||||
- `A` [Maksimal kichik massiv](src/algorithms/sets/maximum-subarray)
|
||||
- `A` [Bellman-Ford Algoritmi](src/algorithms/graph/bellman-ford) - grafikning bir cho'qqisidan qolgan barcha nuqtalarga eng qisqa yo'llarni topish
|
||||
- `A` [Floyd-Warshall Algoritmi](src/algorithms/graph/floyd-warshall) -grafikning barcha uchlari orasidagi eng qisqa masofalarni topish
|
||||
- `A` [Regulyar ifoda moslashuvi](src/algorithms/string/regular-expression-matching)
|
||||
- **Backtracking** - brute forcega o'xshab, barcha mumkin bo'lgan yechimlarni generatsiya qilishga harakat qiladi, lekin har safar keyingi yechimni yaratganingizda, yechim barcha shartlarga javob beradimi yoki yo'qligini tekshirasiz va shundan keyingina keyingi yechimlarni ishlab chiqarishni davom ettirasiz. Aks holda, orqaga qaytib, yechim topishning boshqa yo'liga o'tasiz. Odatda state-space ning DFS-qidiruvi ishlatiladi.
|
||||
- `B` [Sakrash o'yini](src/algorithms/uncategorized/jump-game)
|
||||
- `B` [Noyob yo'llar](src/algorithms/uncategorized/unique-paths)
|
||||
- `B` [Power Set](src/algorithms/sets/power-set) - to'plamning barcha kichik to'plamlari
|
||||
- `A` [Gamilton sikli](src/algorithms/graph/hamiltonian-cycle) - Har bir cho'qqiga bir marta tashrif buyurish
|
||||
- `A` [N-Queens muommosi](src/algorithms/uncategorized/n-queens)
|
||||
- `A` [Ritsar sayohati](src/algorithms/uncategorized/knight-tour)
|
||||
- `A` [Kombinatsiya yig'indisi](src/algorithms/sets/combination-sum) - ma'lum summani tashkil etuvchi barcha kombinatsiyalarni topish
|
||||
- **Branch & Bound** - shu paytgacha topilgan eng arzon echimdan kattaroq xarajatlarga ega qisman echimlarni bekor qilish uchun, backtracking qidiruvining har bir bosqichida topilgan eng arzon echimni eslab qoling va shu paytgacha topilgan eng arzon yechim narxidan muammoni eng kam xarajatli yechim narxining past chegarasi sifatida foydalaning. Odatda state-space daraxtining DFS o'tishi bilan birgalikda BFS traversal qo'llaniladi.
|
||||
|
||||
## Ushbu repozitoriyadan qanday foydalanish kerak
|
||||
|
||||
**Barcha dependensiylarni o'rnating**
|
||||
|
||||
```
|
||||
npm install
|
||||
```
|
||||
|
||||
**ESLint ni ishga tushiring**
|
||||
|
||||
Kod sifatini tekshirish uchun ESLint ni ishga tushirishingiz mumkin.
|
||||
|
||||
```
|
||||
npm run lint
|
||||
```
|
||||
|
||||
**Barcha testlarni ishga tushuring**
|
||||
|
||||
```
|
||||
npm test
|
||||
```
|
||||
|
||||
**Testlarni nom bo'yicha ishga tushirish**
|
||||
|
||||
```
|
||||
npm test -- 'LinkedList'
|
||||
```
|
||||
|
||||
**Muammolarni bartaraf qilish (Troubleshooting)**
|
||||
|
||||
Agar linting yoki sinov muvaffaqiyatsiz bo'lsa, `node_modules` papkasini o'chirib, npm paketlarini qayta o'rnatishga harakat qiling:
|
||||
|
||||
```
|
||||
rm -rf ./node_modules
|
||||
npm i
|
||||
```
|
||||
|
||||
Shuningdek, to'g'ri Node versiyasidan foydalanayotganingizga ishonch hosil qiling (`>=16`). Agar Node versiyasini boshqarish uchun [nvm](https://github.com/nvm-sh/nvm) dan foydalanayotgan bo'lsangiz, loyihaning ildiz papkasidan `nvm use` ni ishga tushiring va to'g'ri versiya tanlanadi.
|
||||
|
||||
**O'yin maydoni (Playground)**
|
||||
|
||||
`./src/playground/playground.js` faylida ma'lumotlar strukturalari va algoritmlar bilan o'ynashingiz, `./src/playground/test/playground.test.js` faylida esa ular uchun testlar yozishingiz mumkin.
|
||||
|
||||
Shundan so'ng, playground kodingiz kutilgandek ishlashini tekshirish uchun quyidagi buyruqni ishga tushirishingiz kifoya:
|
||||
|
||||
```
|
||||
npm test -- 'playground'
|
||||
```
|
||||
|
||||
## Foydali ma'lumotlar
|
||||
|
||||
### Manbalar
|
||||
|
||||
- [▶ Data Structures and Algorithms on YouTube](https://www.youtube.com/playlist?list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
|
||||
- [✍🏻 Data Structure Sketches](https://okso.app/showcase/data-structures)
|
||||
|
||||
### Big O Notation
|
||||
|
||||
_Big O notation_ algoritmlarni kirish hajmi oshgani sayin ularning ishlash vaqti yoki bo'sh joy talablari qanday o'sishiga qarab tasniflash uchun ishlatiladi. Quyidagi jadvalda siz Big O notatsiyasida ko'rsatilgan algoritmlarning o'sishining eng keng tarqalgan tartiblarini topishingiz mumkin.
|
||||
|
||||
|
||||
|
||||
Manba: [Big O Cheat Sheet](http://bigocheatsheet.com/).
|
||||
|
||||
Quyida eng ko'p qo'llaniladigan Big O notatsiyalarining ro'yxati va ularning kirish ma'lumotlarining turli o'lchamlariga nisbatan ishlashini taqqoslash keltirilgan.
|
||||
|
||||
| Big O Notatsiya | Turi | 10 ta element uchun hisob-kitoblar | 100 ta element uchun hisob-kitoblar | 1000 ta element uchun hisob-kitoblar |
|
||||
| --------------- | ------------ | ---------------------------------- | ----------------------------------- | ------------------------------------ |
|
||||
| **O(1)** | O'zgarmas | 1 | 1 | 1 |
|
||||
| **O(log N)** | Logarifmik | 3 | 6 | 9 |
|
||||
| **O(N)** | Chiziqli | 10 | 100 | 1000 |
|
||||
| **O(N log N)** | n log(n) | 30 | 600 | 9000 |
|
||||
| **O(N^2)** | Kvadrat | 100 | 10000 | 1000000 |
|
||||
| **O(2^N)** | Eksponensial | 1024 | 1.26e+29 | 1.07e+301 |
|
||||
| **O(N!)** | Faktorial | 3628800 | 9.3e+157 | 4.02e+2567 |
|
||||
|
||||
### Ma'lumotlar tuzilmalarining operatsiyalari murakkabligi
|
||||
|
||||
| Ma'lumotlar tuzilmalari | Kirish | Qidirish | Kiritish | O'chirish | Izohlar |
|
||||
| --------------------------- | :----: | :------: | :------: | :-------: | :--------------------------------------------------------- |
|
||||
| **Massiv** | 1 | n | n | n | |
|
||||
| **Stak** | n | n | 1 | 1 | |
|
||||
| **Navbat** | n | n | 1 | 1 | |
|
||||
| **Bog'langan ro'yhat** | n | n | 1 | n | |
|
||||
| **Hash jadval** | - | n | n | n | Mukammal xash funksiyasi bo'lsa, xarajatlar O (1) bo'ladi. |
|
||||
| **Ikkilik qidiruv daraxti** | n | n | n | n | Balanslangan daraxt narxida O(log(n)) bo'ladi. |
|
||||
| **B-daraxti** | log(n) | log(n) | log(n) | log(n) | |
|
||||
| **Qizil-qora daraxt** | log(n) | log(n) | log(n) | log(n) | |
|
||||
| **AVL Daraxt** | log(n) | log(n) | log(n) | log(n) | |
|
||||
| **Bloom filtri** | - | 1 | 1 | - | Qidiruv paytida noto'g'ri pozitivlar bo'lishi mumkin |
|
||||
|
||||
### Massivlarni saralash algoritmlarining murakkabligi
|
||||
|
||||
| Nomi | Eng yaxshi | O'rta | Eng yomon | Xotira | Barqaror | Izohlar |
|
||||
| ------------------------- | :-----------: | :---------------------: | :-------------------------: | :----: | :------: | :--------------------------------------------------------------------------- |
|
||||
| **Pufakcha tartiblash** | n | n<sup>2</sup> | n<sup>2</sup> | 1 | Ha | |
|
||||
| **Kiritish tartibi** | n | n<sup>2</sup> | n<sup>2</sup> | 1 | Ha | |
|
||||
| **Tanlash tartibi** | n<sup>2</sup> | n<sup>2</sup> | n<sup>2</sup> | 1 | Yo'q | |
|
||||
| **Heap tartibi** | n log(n) | n log(n) | n log(n) | 1 | Yo'q | |
|
||||
| **Birlashtirish tartibi** | n log(n) | n log(n) | n log(n) | n | Ha | |
|
||||
| **Tezkor saralash** | n log(n) | n log(n) | n<sup>2</sup> | log(n) | Yo'q | Tezkor saralash odatda O(log(n)) stek maydoni bilan joyida amalga oshiriladi |
|
||||
| **Shell tartiblash** | n log(n) | depends on gap sequence | n (log(n))<sup>2</sup> | 1 | Yo'q | |
|
||||
| **Sanash tartibi** | n + r | n + r | n + r | n + r | Ha | r - massivdagi eng katta raqam |
|
||||
| **Radiksli tartiblash** | n \* k | n \* k | n \* k | n + k | Ha | k - eng uzun kalitning uzunligi |
|
||||
|
||||
## Loyihani qo'llab-quvvatlovchilar
|
||||
|
||||
> Siz ushbu loyihani ❤️️ [GitHub](https://github.com/sponsors/trekhleb) yoki ❤️️ [Patreon](https://www.patreon.com/trekhleb) orqali qo'llab-quvvatlashingiz mumkin.
|
||||
|
||||
[Ushbu loyihani qo'llab-quvvatlagan odamlar](https://github.com/trekhleb/javascript-algorithms/blob/master/BACKERS.md) `∑ = 1`
|
||||
|
||||
## Muallif
|
||||
|
||||
[@trekhleb](https://trekhleb.dev)
|
||||
|
||||
A few more [projects](https://trekhleb.dev/projects/) and [articles](https://trekhleb.dev/blog/) about JavaScript and algorithms on [trekhleb.dev](https://trekhleb.dev)
|
||||
@ -23,7 +23,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
*注意：这个项目仅用于学习和研究，**不是**用于生产环境。*
|
||||
|
||||
|
||||
@ -22,7 +22,8 @@ _Read this in other languages:_
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_Arabic_](README.ar-AR.md),
|
||||
[_Tiếng Việt_](README.vi-VN.md),
|
||||
[_Deutsch_](README.de-DE.md)
|
||||
[_Deutsch_](README.de-DE.md),
|
||||
[_Uzbek_](README.uz-UZ.md)
|
||||
|
||||
## 資料結構
|
||||
|
||||
|
||||
@ -24,7 +24,9 @@ module.exports = {
|
||||
// This option sets the URL for the jsdom environment.
|
||||
// It is reflected in properties such as location.href.
|
||||
// @see: https://github.com/facebook/jest/issues/6769
|
||||
testURL: 'http://localhost/',
|
||||
testEnvironmentOptions: {
|
||||
url: 'http://localhost/',
|
||||
},
|
||||
|
||||
// @see: https://jestjs.io/docs/en/configuration#coveragethreshold-object
|
||||
coverageThreshold: {
|
||||
|
||||
14002
package-lock.json
generated
14002
package-lock.json
generated
File diff suppressed because it is too large
Load Diff
25
package.json
25
package.json
@ -35,21 +35,20 @@
|
||||
"prepare": "husky install"
|
||||
},
|
||||
"devDependencies": {
|
||||
"@babel/cli": "7.16.8",
|
||||
"@babel/preset-env": "7.16.11",
|
||||
"@types/jest": "27.4.0",
|
||||
"canvas": "2.9.0",
|
||||
"eslint": "8.7.0",
|
||||
"@babel/cli": "7.20.7",
|
||||
"@babel/preset-env": "7.20.2",
|
||||
"@types/jest": "29.4.0",
|
||||
"eslint": "8.33.0",
|
||||
"eslint-config-airbnb": "19.0.4",
|
||||
"eslint-plugin-import": "2.25.4",
|
||||
"eslint-plugin-jest": "25.7.0",
|
||||
"eslint-plugin-jsx-a11y": "6.5.1",
|
||||
"eslint-plugin-react": "7.28.0",
|
||||
"husky": "7.0.4",
|
||||
"jest": "27.4.7"
|
||||
"eslint-plugin-import": "2.27.5",
|
||||
"eslint-plugin-jest": "27.2.1",
|
||||
"eslint-plugin-jsx-a11y": "6.7.1",
|
||||
"husky": "8.0.3",
|
||||
"jest": "29.4.1",
|
||||
"pngjs": "^7.0.0"
|
||||
},
|
||||
"engines": {
|
||||
"node": ">=14.16.0",
|
||||
"npm": ">=6.14.0"
|
||||
"node": ">=16.15.0",
|
||||
"npm": ">=8.5.5"
|
||||
}
|
||||
}
|
||||
|
||||
@ -0,0 +1,85 @@
|
||||
import fs from 'fs';
|
||||
import { PNG } from 'pngjs';
|
||||
|
||||
import resizeImageWidth from '../resizeImageWidth';
|
||||
|
||||
const testImageBeforePath = './src/algorithms/image-processing/seam-carving/__tests__/test-image-before.png';
|
||||
const testImageAfterPath = './src/algorithms/image-processing/seam-carving/__tests__/test-image-after.png';
|
||||
|
||||
/**
|
||||
* Compares two images and finds the number of different pixels.
|
||||
*
|
||||
* @param {ImageData} imgA - ImageData for the first image.
|
||||
* @param {ImageData} imgB - ImageData for the second image.
|
||||
* @param {number} threshold - Color difference threshold [0..255]. Smaller - stricter.
|
||||
* @returns {number} - Number of different pixels.
|
||||
*/
|
||||
function pixelsDiff(imgA, imgB, threshold = 0) {
|
||||
if (imgA.width !== imgB.width || imgA.height !== imgB.height) {
|
||||
throw new Error('Images must have the same size');
|
||||
}
|
||||
|
||||
let differentPixels = 0;
|
||||
const numColorParams = 4; // RGBA
|
||||
|
||||
for (let pixelIndex = 0; pixelIndex < imgA.data.length; pixelIndex += numColorParams) {
|
||||
// Get pixel's color for each image.
|
||||
const [aR, aG, aB] = imgA.data.subarray(pixelIndex, pixelIndex + numColorParams);
|
||||
const [bR, bG, bB] = imgB.data.subarray(pixelIndex, pixelIndex + numColorParams);
|
||||
|
||||
// Get average pixel's color for each image (make them greyscale).
|
||||
const aAvgColor = Math.floor((aR + aG + aB) / 3);
|
||||
const bAvgColor = Math.floor((bR + bG + bB) / 3);
|
||||
|
||||
// Compare pixel colors.
|
||||
if (Math.abs(aAvgColor - bAvgColor) > threshold) {
|
||||
differentPixels += 1;
|
||||
}
|
||||
}
|
||||
|
||||
return differentPixels;
|
||||
}
|
||||
|
||||
const pngLoad = (path) => new Promise((resolve) => {
|
||||
fs.createReadStream(path)
|
||||
.pipe(new PNG())
|
||||
.on('parsed', function Parsed() {
|
||||
/** @type {ImageData} */
|
||||
const imageData = {
|
||||
colorSpace: 'srgb',
|
||||
width: this.width,
|
||||
height: this.height,
|
||||
data: this.data,
|
||||
};
|
||||
resolve(imageData);
|
||||
});
|
||||
});
|
||||
|
||||
describe('resizeImageWidth', () => {
|
||||
it('should perform content-aware image width reduction', async () => {
|
||||
const imgBefore = await pngLoad(testImageBeforePath);
|
||||
const imgAfter = await pngLoad(testImageAfterPath);
|
||||
|
||||
const toWidth = Math.floor(imgBefore.width / 2);
|
||||
|
||||
const {
|
||||
img: imgResized,
|
||||
size: resizedSize,
|
||||
} = resizeImageWidth({ img: imgBefore, toWidth });
|
||||
|
||||
expect(imgResized).toBeDefined();
|
||||
expect(resizedSize).toBeDefined();
|
||||
|
||||
expect(resizedSize).toEqual({ w: toWidth, h: imgBefore.height });
|
||||
expect(imgResized.width).toBe(imgAfter.width);
|
||||
expect(imgResized.height).toBe(imgAfter.height);
|
||||
|
||||
const colorThreshold = 50;
|
||||
const differentPixels = pixelsDiff(imgResized, imgAfter, colorThreshold);
|
||||
|
||||
// Allow 10% of pixels to be different
|
||||
const pixelsThreshold = Math.floor((imgAfter.width * imgAfter.height) / 10);
|
||||
|
||||
expect(differentPixels).toBeLessThanOrEqual(pixelsThreshold);
|
||||
});
|
||||
});
|
||||
@ -1,91 +0,0 @@
|
||||
import { createCanvas, loadImage } from 'canvas';
|
||||
import resizeImageWidth from '../resizeImageWidth';
|
||||
|
||||
const testImageBeforePath = './src/algorithms/image-processing/seam-carving/__tests__/test-image-before.jpg';
|
||||
const testImageAfterPath = './src/algorithms/image-processing/seam-carving/__tests__/test-image-after.jpg';
|
||||
|
||||
/**
|
||||
* Compares two images and finds the number of different pixels.
|
||||
*
|
||||
* @param {ImageData} imgA - ImageData for the first image.
|
||||
* @param {ImageData} imgB - ImageData for the second image.
|
||||
* @param {number} threshold - Color difference threshold [0..255]. Smaller - stricter.
|
||||
* @returns {number} - Number of different pixels.
|
||||
*/
|
||||
function pixelsDiff(imgA, imgB, threshold = 0) {
|
||||
if (imgA.width !== imgB.width || imgA.height !== imgB.height) {
|
||||
throw new Error('Images must have the same size');
|
||||
}
|
||||
|
||||
let differentPixels = 0;
|
||||
const numColorParams = 4; // RGBA
|
||||
|
||||
for (let pixelIndex = 0; pixelIndex < imgA.data.length; pixelIndex += numColorParams) {
|
||||
// Get pixel's color for each image.
|
||||
const [aR, aG, aB] = imgA.data.subarray(pixelIndex, pixelIndex + numColorParams);
|
||||
const [bR, bG, bB] = imgB.data.subarray(pixelIndex, pixelIndex + numColorParams);
|
||||
|
||||
// Get average pixel's color for each image (make them greyscale).
|
||||
const aAvgColor = Math.floor((aR + aG + aB) / 3);
|
||||
const bAvgColor = Math.floor((bR + bG + bB) / 3);
|
||||
|
||||
// Compare pixel colors.
|
||||
if (Math.abs(aAvgColor - bAvgColor) > threshold) {
|
||||
differentPixels += 1;
|
||||
}
|
||||
}
|
||||
|
||||
return differentPixels;
|
||||
}
|
||||
|
||||
describe('resizeImageWidth', () => {
|
||||
it('should perform content-aware image width reduction', () => {
|
||||
// @see: https://jestjs.io/docs/asynchronous
|
||||
return Promise.all([
|
||||
loadImage(testImageBeforePath),
|
||||
loadImage(testImageAfterPath),
|
||||
]).then(([imgBefore, imgAfter]) => {
|
||||
// Original image.
|
||||
const canvasBefore = createCanvas(imgBefore.width, imgBefore.height);
|
||||
const ctxBefore = canvasBefore.getContext('2d');
|
||||
ctxBefore.drawImage(imgBefore, 0, 0, imgBefore.width, imgBefore.height);
|
||||
const imgDataBefore = ctxBefore.getImageData(0, 0, imgBefore.width, imgBefore.height);
|
||||
|
||||
// Resized image saved.
|
||||
const canvasAfter = createCanvas(imgAfter.width, imgAfter.height);
|
||||
const ctxAfter = canvasAfter.getContext('2d');
|
||||
ctxAfter.drawImage(imgAfter, 0, 0, imgAfter.width, imgAfter.height);
|
||||
const imgDataAfter = ctxAfter.getImageData(0, 0, imgAfter.width, imgAfter.height);
|
||||
|
||||
const toWidth = Math.floor(imgBefore.width / 2);
|
||||
|
||||
const {
|
||||
img: resizedImg,
|
||||
size: resizedSize,
|
||||
} = resizeImageWidth({ img: imgDataBefore, toWidth });
|
||||
|
||||
expect(resizedImg).toBeDefined();
|
||||
expect(resizedSize).toBeDefined();
|
||||
|
||||
// Resized image generated.
|
||||
const canvasTest = createCanvas(resizedSize.w, resizedSize.h);
|
||||
const ctxTest = canvasTest.getContext('2d');
|
||||
ctxTest.putImageData(resizedImg, 0, 0, 0, 0, resizedSize.w, resizedSize.h);
|
||||
const imgDataTest = ctxTest.getImageData(0, 0, resizedSize.w, resizedSize.h);
|
||||
|
||||
expect(resizedSize).toEqual({ w: toWidth, h: imgBefore.height });
|
||||
expect(imgDataTest.width).toBe(toWidth);
|
||||
expect(imgDataTest.height).toBe(imgBefore.height);
|
||||
expect(imgDataTest.width).toBe(imgAfter.width);
|
||||
expect(imgDataTest.height).toBe(imgAfter.height);
|
||||
|
||||
const colorThreshold = 50;
|
||||
const differentPixels = pixelsDiff(imgDataTest, imgDataAfter, colorThreshold);
|
||||
|
||||
// Allow 10% of pixels to be different
|
||||
const pixelsThreshold = Math.floor((imgAfter.width * imgAfter.height) / 10);
|
||||
|
||||
expect(differentPixels).toBeLessThanOrEqual(pixelsThreshold);
|
||||
});
|
||||
});
|
||||
});
|
||||
Binary file not shown.
|
Before Width: | Height: | Size: 5.9 KiB |
Binary file not shown.
|
After Width: | Height: | Size: 6.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.3 KiB |
Binary file not shown.
|
After Width: | Height: | Size: 12 KiB |
@ -1,7 +1,7 @@
|
||||
# Factorial
|
||||
|
||||
_Read this in other languages:_
|
||||
[_简体中文_](README.zh-CN.md), [français](README.fr-FR.md), [turkish](README.tr-TR.md), [ქართული](README.ka-GE.md).
|
||||
[_简体中文_](README.zh-CN.md), [_Français_](README.fr-FR.md), [_Türkçe_](README.tr-TR.md), [_ქართული_](README.ka-GE.md), [_Українська_](README.uk-UA.md).
|
||||
|
||||
In mathematics, the factorial of a non-negative integer `n`,
|
||||
denoted by `n!`, is the product of all positive integers less
|
||||
|
||||
33
src/algorithms/math/factorial/README.uk-UA.md
Normal file
33
src/algorithms/math/factorial/README.uk-UA.md
Normal file
@ -0,0 +1,33 @@
|
||||
# Факторіал
|
||||
|
||||
_Прочитайте це іншими мовами:_
|
||||
[_English_](README.md), [_简体中文_](README.zh-CN.md), [_Français_](README.fr-FR.md), [_Türkçe_](README.tr-TR.md), [_ქართული_](README.ka-GE.md).
|
||||
|
||||
У математиці факторіал невід'ємного цілого числа `n`, позначений `n!`, є добутком усіх натуральних чисел, менших або рівних `n`. Наприклад:
|
||||
|
||||
```
|
||||
5! = 5 * 4 * 3 * 2 * 1 = 120
|
||||
```
|
||||
|
||||
| n | n! |
|
||||
| --- | ----------------: |
|
||||
| 0 | 1 |
|
||||
| 1 | 1 |
|
||||
| 2 | 2 |
|
||||
| 3 | 6 |
|
||||
| 4 | 24 |
|
||||
| 5 | 120 |
|
||||
| 6 | 720 |
|
||||
| 7 | 5 040 |
|
||||
| 8 | 40 320 |
|
||||
| 9 | 362 880 |
|
||||
| 10 | 3 628 800 |
|
||||
| 11 | 39 916 800 |
|
||||
| 12 | 479 001 600 |
|
||||
| 13 | 6 227 020 800 |
|
||||
| 14 | 87 178 291 200 |
|
||||
| 15 | 1 307 674 368 000 |
|
||||
|
||||
## Посилання
|
||||
|
||||
[Wikipedia](https://uk.wikipedia.org/wiki/%D0%A4%D0%B0%D0%BA%D1%82%D0%BE%D1%80%D1%96%D0%B0%D0%BB)
|
||||
@ -30,6 +30,11 @@ _Image source: [Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering)_
|
||||
|
||||
The centroids are moving continuously in order to create better distinction between the different set of data points. As we can see, after a few iterations, the difference in centroids is quite low between iterations. For example between iterations `13` and `14` the difference is quite small because there the optimizer is tuning boundary cases.
|
||||
|
||||
## Code Examples
|
||||
|
||||
- [kMeans.js](./kMeans.js)
|
||||
- [kMeans.test.js](./__test__/kMeans.test.js) (test cases)
|
||||
|
||||
## References
|
||||
|
||||
- [k-Means neighbors algorithm on Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering)
|
||||
|
||||
@ -11,7 +11,7 @@ import Comparator from '../../../utils/comparator/Comparator';
|
||||
|
||||
export default function binarySearch(sortedArray, seekElement, comparatorCallback) {
|
||||
// Let's create comparator from the comparatorCallback function.
|
||||
// Comparator object will give us common comparison methods like equal() and lessThen().
|
||||
// Comparator object will give us common comparison methods like equal() and lessThan().
|
||||
const comparator = new Comparator(comparatorCallback);
|
||||
|
||||
// These two indices will contain current array (sub-array) boundaries.
|
||||
|
||||
@ -0,0 +1,17 @@
|
||||
import longestCommonSubsequence from '../longestCommonSubsequenceRecursive';
|
||||
|
||||
describe('longestCommonSubsequenceRecursive', () => {
|
||||
it('should find longest common substring between two strings', () => {
|
||||
expect(longestCommonSubsequence('', '')).toBe('');
|
||||
expect(longestCommonSubsequence('ABC', '')).toBe('');
|
||||
expect(longestCommonSubsequence('', 'ABC')).toBe('');
|
||||
expect(longestCommonSubsequence('ABABC', 'BABCA')).toBe('BABC');
|
||||
expect(longestCommonSubsequence('BABCA', 'ABCBA')).toBe('ABCA');
|
||||
expect(longestCommonSubsequence('sea', 'eat')).toBe('ea');
|
||||
expect(longestCommonSubsequence('algorithms', 'rithm')).toBe('rithm');
|
||||
expect(longestCommonSubsequence(
|
||||
'Algorithms and data structures implemented in JavaScript',
|
||||
'Here you may find Algorithms and data structures that are implemented in JavaScript',
|
||||
)).toBe('Algorithms and data structures implemented in JavaScript');
|
||||
});
|
||||
});
|
||||
@ -0,0 +1,36 @@
|
||||
/* eslint-disable no-param-reassign */
|
||||
/**
|
||||
* Longest Common Subsequence (LCS) (Recursive Approach).
|
||||
*
|
||||
* @param {string} string1
|
||||
* @param {string} string2
|
||||
* @return {number}
|
||||
*/
|
||||
export default function longestCommonSubsequenceRecursive(string1, string2) {
|
||||
/**
|
||||
*
|
||||
* @param {string} s1
|
||||
* @param {string} s2
|
||||
* @return {string} - returns the LCS (Longest Common Subsequence)
|
||||
*/
|
||||
const lcs = (s1, s2, memo = {}) => {
|
||||
if (!s1 || !s2) return '';
|
||||
|
||||
if (memo[`${s1}:${s2}`]) return memo[`${s1}:${s2}`];
|
||||
|
||||
if (s1[0] === s2[0]) {
|
||||
return s1[0] + lcs(s1.substring(1), s2.substring(1), memo);
|
||||
}
|
||||
|
||||
const nextLcs1 = lcs(s1.substring(1), s2, memo);
|
||||
const nextLcs2 = lcs(s1, s2.substring(1), memo);
|
||||
|
||||
const nextLongest = nextLcs1.length >= nextLcs2.length ? nextLcs1 : nextLcs2;
|
||||
|
||||
memo[`${s1}:${s2}`] = nextLongest;
|
||||
|
||||
return nextLongest;
|
||||
};
|
||||
|
||||
return lcs(string1, string2);
|
||||
}
|
||||
46
src/algorithms/sorting/bucket-sort/BucketSort.js
Normal file
46
src/algorithms/sorting/bucket-sort/BucketSort.js
Normal file
@ -0,0 +1,46 @@
|
||||
import RadixSort from '../radix-sort/RadixSort';
|
||||
|
||||
/**
|
||||
* Bucket Sort
|
||||
*
|
||||
* @param {number[]} arr
|
||||
* @param {number} bucketsNum
|
||||
* @return {number[]}
|
||||
*/
|
||||
export default function BucketSort(arr, bucketsNum = 1) {
|
||||
const buckets = new Array(bucketsNum).fill(null).map(() => []);
|
||||
|
||||
const minValue = Math.min(...arr);
|
||||
const maxValue = Math.max(...arr);
|
||||
|
||||
const bucketSize = Math.ceil(Math.max(1, (maxValue - minValue) / bucketsNum));
|
||||
|
||||
// Place elements into buckets.
|
||||
for (let i = 0; i < arr.length; i += 1) {
|
||||
const currValue = arr[i];
|
||||
const bucketIndex = Math.floor((currValue - minValue) / bucketSize);
|
||||
|
||||
// Edge case for max value.
|
||||
if (bucketIndex === bucketsNum) {
|
||||
buckets[bucketsNum - 1].push(currValue);
|
||||
} else {
|
||||
buckets[bucketIndex].push(currValue);
|
||||
}
|
||||
}
|
||||
|
||||
// Sort individual buckets.
|
||||
for (let i = 0; i < buckets.length; i += 1) {
|
||||
// Let's use the Radix Sorter here. This may give us
|
||||
// the average O(n + k) time complexity to sort one bucket
|
||||
// (where k is a number of digits in the longest number).
|
||||
buckets[i] = new RadixSort().sort(buckets[i]);
|
||||
}
|
||||
|
||||
// Merge sorted buckets into final output.
|
||||
const sortedArr = [];
|
||||
for (let i = 0; i < buckets.length; i += 1) {
|
||||
sortedArr.push(...buckets[i]);
|
||||
}
|
||||
|
||||
return sortedArr;
|
||||
}
|
||||
35
src/algorithms/sorting/bucket-sort/README.md
Normal file
35
src/algorithms/sorting/bucket-sort/README.md
Normal file
@ -0,0 +1,35 @@
|
||||
# Bucket Sort
|
||||
|
||||
**Bucket sort**, or **bin sort**, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
|
||||
|
||||
## Algorithm
|
||||
|
||||
Bucket sort works as follows:
|
||||
|
||||
1. Set up an array of initially empty `buckets`.
|
||||
2. **Scatter:** Go over the original array, putting each object in its `bucket`.
|
||||
3. Sort each non-empty `bucket`.
|
||||
4. **Gather:** Visit the `buckets` in order and put all elements back into the original array.
|
||||
|
||||
Elements are distributed among bins:
|
||||
|
||||
|
||||
|
||||
Then, elements are sorted within each bin:
|
||||
|
||||
|
||||
|
||||
|
||||
## Complexity
|
||||
|
||||
The computational complexity depends on the algorithm used to sort each bucket, the number of buckets to use, and whether the input is uniformly distributed.
|
||||
|
||||
The **worst-case** time complexity of bucket sort is
|
||||
`O(n^2)` if the sorting algorithm used on the bucket is *insertion sort*, which is the most common use case since the expectation is that buckets will not have too many elements relative to the entire list. In the worst case, all elements are placed in one bucket, causing the running time to reduce to the worst-case complexity of insertion sort (all elements are in reverse order). If the worst-case running time of the intermediate sort used is `O(n * log(n))`, then the worst-case running time of bucket sort will also be
|
||||
`O(n * log(n))`.
|
||||
|
||||
On **average**, when the distribution of elements across buckets is reasonably uniform, it can be shown that bucket sort runs on average `O(n + k)` for `k` buckets.
|
||||
|
||||
## References
|
||||
|
||||
- [Bucket Sort on Wikipedia](https://en.wikipedia.org/wiki/Bucket_sort)
|
||||
@ -0,0 +1,33 @@
|
||||
import BucketSort from '../BucketSort';
|
||||
import {
|
||||
equalArr,
|
||||
notSortedArr,
|
||||
reverseArr,
|
||||
sortedArr,
|
||||
} from '../../SortTester';
|
||||
|
||||
describe('BucketSort', () => {
|
||||
it('should sort the array of numbers with different buckets amounts', () => {
|
||||
expect(BucketSort(notSortedArr, 4)).toEqual(sortedArr);
|
||||
expect(BucketSort(equalArr, 4)).toEqual(equalArr);
|
||||
expect(BucketSort(reverseArr, 4)).toEqual(sortedArr);
|
||||
expect(BucketSort(sortedArr, 4)).toEqual(sortedArr);
|
||||
|
||||
expect(BucketSort(notSortedArr, 10)).toEqual(sortedArr);
|
||||
expect(BucketSort(equalArr, 10)).toEqual(equalArr);
|
||||
expect(BucketSort(reverseArr, 10)).toEqual(sortedArr);
|
||||
expect(BucketSort(sortedArr, 10)).toEqual(sortedArr);
|
||||
|
||||
expect(BucketSort(notSortedArr, 50)).toEqual(sortedArr);
|
||||
expect(BucketSort(equalArr, 50)).toEqual(equalArr);
|
||||
expect(BucketSort(reverseArr, 50)).toEqual(sortedArr);
|
||||
expect(BucketSort(sortedArr, 50)).toEqual(sortedArr);
|
||||
});
|
||||
|
||||
it('should sort the array of numbers with the default buckets of 1', () => {
|
||||
expect(BucketSort(notSortedArr)).toEqual(sortedArr);
|
||||
expect(BucketSort(equalArr)).toEqual(equalArr);
|
||||
expect(BucketSort(reverseArr)).toEqual(sortedArr);
|
||||
expect(BucketSort(sortedArr)).toEqual(sortedArr);
|
||||
});
|
||||
});
|
||||
BIN
src/algorithms/sorting/bucket-sort/images/bucket_sort_1.png
Normal file
BIN
src/algorithms/sorting/bucket-sort/images/bucket_sort_1.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 11 KiB |
BIN
src/algorithms/sorting/bucket-sort/images/bucket_sort_2.png
Normal file
BIN
src/algorithms/sorting/bucket-sort/images/bucket_sort_2.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 13 KiB |
@ -33,7 +33,7 @@ store them in memory, which gives at best a time complexity `O(n log n)`. That
|
||||
would seem to make radix sort at most equally efficient as the best
|
||||
comparison-based sorts (and worse if keys are much longer than `log n`).
|
||||
|
||||
|
||||
|
||||
|
||||
## Complexity
|
||||
|
||||
|
||||
BIN
src/algorithms/sorting/radix-sort/images/radix-sort.png
Normal file
BIN
src/algorithms/sorting/radix-sort/images/radix-sort.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 12 KiB |
@ -7,6 +7,8 @@ describe('longestCommonSubstring', () => {
|
||||
expect(longestCommonSubstring('', 'ABC')).toBe('');
|
||||
expect(longestCommonSubstring('ABABC', 'BABCA')).toBe('BABC');
|
||||
expect(longestCommonSubstring('BABCA', 'ABCBA')).toBe('ABC');
|
||||
expect(longestCommonSubstring('sea', 'eat')).toBe('ea');
|
||||
expect(longestCommonSubstring('algorithms', 'rithm')).toBe('rithm');
|
||||
expect(longestCommonSubstring(
|
||||
'Algorithms and data structures implemented in JavaScript',
|
||||
'Here you may find Algorithms and data structures that are implemented in JavaScript',
|
||||
|
||||
@ -1,4 +1,6 @@
|
||||
/**
|
||||
* Longest Common Substring (LCS) (Dynamic Programming Approach).
|
||||
*
|
||||
* @param {string} string1
|
||||
* @param {string} string2
|
||||
* @return {string}
|
||||
|
||||
@ -46,7 +46,7 @@ Let's say we have an array of prices `[7, 6, 4, 3, 1]` and we're on the _1st_ da
|
||||
1. _Option 1: Keep the money_ → profit would equal to the profit from buying/selling the rest of the stocks → `keepProfit = profit([6, 4, 3, 1])`.
|
||||
2. _Option 2: Buy/sell at current price_ → profit in this case would equal to the profit from buying/selling the rest of the stocks plus (or minus, depending on whether we're selling or buying) the current stock price → `buySellProfit = -7 + profit([6, 4, 3, 1])`.
|
||||
|
||||
The overall profit would be equal to → `overalProfit = Max(keepProfit, buySellProfit)`.
|
||||
The overall profit would be equal to → `overallProfit = Max(keepProfit, buySellProfit)`.
|
||||
|
||||
As you can see the `profit([6, 4, 3, 1])` task is being solved in the same recursive manner.
|
||||
|
||||
|
||||
@ -59,7 +59,7 @@ and return false.
|
||||
queen here leads to a solution.
|
||||
b) If placing queen in [row, column] leads to a solution then return
|
||||
true.
|
||||
c) If placing queen doesn't lead to a solution then umark this [row,
|
||||
c) If placing queen doesn't lead to a solution then unmark this [row,
|
||||
column] (Backtrack) and go to step (a) to try other rows.
|
||||
3) If all rows have been tried and nothing worked, return false to trigger
|
||||
backtracking.
|
||||
|
||||
@ -93,7 +93,7 @@ three factors: the size of the bloom filter, the
|
||||
number of hash functions we use, and the number
|
||||
of items that have been inserted into the filter.
|
||||
|
||||
The formula to calculate probablity of a false positive is:
|
||||
The formula to calculate probability of a false positive is:
|
||||
|
||||
( 1 - e <sup>-kn/m</sup> ) <sup>k</sup>
|
||||
|
||||
|
||||
78
src/data-structures/disjoint-set/DisjointSetAdhoc.js
Normal file
78
src/data-structures/disjoint-set/DisjointSetAdhoc.js
Normal file
@ -0,0 +1,78 @@
|
||||
/**
|
||||
* The minimalistic (ad hoc) version of a DisjointSet (or a UnionFind) data structure
|
||||
* that doesn't have external dependencies and that is easy to copy-paste and
|
||||
* use during the coding interview if allowed by the interviewer (since many
|
||||
* data structures in JS are missing).
|
||||
*
|
||||
* Time Complexity:
|
||||
*
|
||||
* - Constructor: O(N)
|
||||
* - Find: O(α(N))
|
||||
* - Union: O(α(N))
|
||||
* - Connected: O(α(N))
|
||||
*
|
||||
* Where N is the number of vertices in the graph.
|
||||
* α refers to the Inverse Ackermann function.
|
||||
* In practice, we assume it's a constant.
|
||||
* In other words, O(α(N)) is regarded as O(1) on average.
|
||||
*/
|
||||
class DisjointSetAdhoc {
|
||||
/**
|
||||
* Initializes the set of specified size.
|
||||
* @param {number} size
|
||||
*/
|
||||
constructor(size) {
|
||||
// The index of a cell is an id of the node in a set.
|
||||
// The value of a cell is an id (index) of the root node.
|
||||
// By default, the node is a parent of itself.
|
||||
this.roots = new Array(size).fill(0).map((_, i) => i);
|
||||
|
||||
// Using the heights array to record the height of each node.
|
||||
// By default each node has a height of 1 because it has no children.
|
||||
this.heights = new Array(size).fill(1);
|
||||
}
|
||||
|
||||
/**
|
||||
* Finds the root of node `a`
|
||||
* @param {number} a
|
||||
* @returns {number}
|
||||
*/
|
||||
find(a) {
|
||||
if (a === this.roots[a]) return a;
|
||||
this.roots[a] = this.find(this.roots[a]);
|
||||
return this.roots[a];
|
||||
}
|
||||
|
||||
/**
|
||||
* Joins the `a` and `b` nodes into same set.
|
||||
* @param {number} a
|
||||
* @param {number} b
|
||||
* @returns {number}
|
||||
*/
|
||||
union(a, b) {
|
||||
const aRoot = this.find(a);
|
||||
const bRoot = this.find(b);
|
||||
|
||||
if (aRoot === bRoot) return;
|
||||
|
||||
if (this.heights[aRoot] > this.heights[bRoot]) {
|
||||
this.roots[bRoot] = aRoot;
|
||||
} else if (this.heights[aRoot] < this.heights[bRoot]) {
|
||||
this.roots[aRoot] = bRoot;
|
||||
} else {
|
||||
this.roots[bRoot] = aRoot;
|
||||
this.heights[aRoot] += 1;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Checks if `a` and `b` belong to the same set.
|
||||
* @param {number} a
|
||||
* @param {number} b
|
||||
*/
|
||||
connected(a, b) {
|
||||
return this.find(a) === this.find(b);
|
||||
}
|
||||
}
|
||||
|
||||
export default DisjointSetAdhoc;
|
||||
@ -19,6 +19,11 @@ _MakeSet_ creates 8 singletons.
|
||||
|
||||
After some operations of _Union_, some sets are grouped together.
|
||||
|
||||
## Implementation
|
||||
|
||||
- [DisjointSet.js](./DisjointSet.js)
|
||||
- [DisjointSetAdhoc.js](./DisjointSetAdhoc.js) - The minimalistic (ad hoc) version of a DisjointSet (or a UnionFind) data structure that doesn't have external dependencies and that is easy to copy-paste and use during the coding interview if allowed by the interviewer (since many data structures in JS are missing).
|
||||
|
||||
## References
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Disjoint-set_data_structure)
|
||||
|
||||
@ -0,0 +1,50 @@
|
||||
import DisjointSetAdhoc from '../DisjointSetAdhoc';
|
||||
|
||||
describe('DisjointSetAdhoc', () => {
|
||||
it('should create unions and find connected elements', () => {
|
||||
const set = new DisjointSetAdhoc(10);
|
||||
|
||||
// 1-2-5-6-7 3-8-9 4
|
||||
set.union(1, 2);
|
||||
set.union(2, 5);
|
||||
set.union(5, 6);
|
||||
set.union(6, 7);
|
||||
|
||||
set.union(3, 8);
|
||||
set.union(8, 9);
|
||||
|
||||
expect(set.connected(1, 5)).toBe(true);
|
||||
expect(set.connected(5, 7)).toBe(true);
|
||||
expect(set.connected(3, 8)).toBe(true);
|
||||
|
||||
expect(set.connected(4, 9)).toBe(false);
|
||||
expect(set.connected(4, 7)).toBe(false);
|
||||
|
||||
// 1-2-5-6-7 3-8-9-4
|
||||
set.union(9, 4);
|
||||
|
||||
expect(set.connected(4, 9)).toBe(true);
|
||||
expect(set.connected(4, 3)).toBe(true);
|
||||
expect(set.connected(8, 4)).toBe(true);
|
||||
|
||||
expect(set.connected(8, 7)).toBe(false);
|
||||
expect(set.connected(2, 3)).toBe(false);
|
||||
});
|
||||
|
||||
it('should keep the height of the tree small', () => {
|
||||
const set = new DisjointSetAdhoc(10);
|
||||
|
||||
// 1-2-6-7-9 1 3 4 5
|
||||
set.union(7, 6);
|
||||
set.union(1, 2);
|
||||
set.union(2, 6);
|
||||
set.union(1, 7);
|
||||
set.union(9, 1);
|
||||
|
||||
expect(set.connected(1, 7)).toBe(true);
|
||||
expect(set.connected(6, 9)).toBe(true);
|
||||
expect(set.connected(4, 9)).toBe(false);
|
||||
|
||||
expect(Math.max(...set.heights)).toBe(3);
|
||||
});
|
||||
});
|
||||
@ -279,7 +279,7 @@ export default class Heap {
|
||||
/* istanbul ignore next */
|
||||
pairIsInCorrectOrder(firstElement, secondElement) {
|
||||
throw new Error(`
|
||||
You have to implement heap pair comparision method
|
||||
You have to implement heap pair comparison method
|
||||
for ${firstElement} and ${secondElement} values.
|
||||
`);
|
||||
}
|
||||
|
||||
115
src/data-structures/heap/MaxHeapAdhoc.js
Normal file
115
src/data-structures/heap/MaxHeapAdhoc.js
Normal file
@ -0,0 +1,115 @@
|
||||
/**
|
||||
* The minimalistic (ad hoc) version of a MaxHeap data structure that doesn't have
|
||||
* external dependencies and that is easy to copy-paste and use during the
|
||||
* coding interview if allowed by the interviewer (since many data
|
||||
* structures in JS are missing).
|
||||
*/
|
||||
class MaxHeapAdhoc {
|
||||
constructor(heap = []) {
|
||||
this.heap = [];
|
||||
heap.forEach(this.add);
|
||||
}
|
||||
|
||||
add(num) {
|
||||
this.heap.push(num);
|
||||
this.heapifyUp();
|
||||
}
|
||||
|
||||
peek() {
|
||||
return this.heap[0];
|
||||
}
|
||||
|
||||
poll() {
|
||||
if (this.heap.length === 0) return undefined;
|
||||
const top = this.heap[0];
|
||||
this.heap[0] = this.heap[this.heap.length - 1];
|
||||
this.heap.pop();
|
||||
this.heapifyDown();
|
||||
return top;
|
||||
}
|
||||
|
||||
isEmpty() {
|
||||
return this.heap.length === 0;
|
||||
}
|
||||
|
||||
toString() {
|
||||
return this.heap.join(',');
|
||||
}
|
||||
|
||||
heapifyUp() {
|
||||
let nodeIndex = this.heap.length - 1;
|
||||
while (nodeIndex > 0) {
|
||||
const parentIndex = this.getParentIndex(nodeIndex);
|
||||
if (this.heap[parentIndex] >= this.heap[nodeIndex]) break;
|
||||
this.swap(parentIndex, nodeIndex);
|
||||
nodeIndex = parentIndex;
|
||||
}
|
||||
}
|
||||
|
||||
heapifyDown() {
|
||||
let nodeIndex = 0;
|
||||
|
||||
while (
|
||||
(
|
||||
this.hasLeftChild(nodeIndex) && this.heap[nodeIndex] < this.leftChild(nodeIndex)
|
||||
)
|
||||
|| (
|
||||
this.hasRightChild(nodeIndex) && this.heap[nodeIndex] < this.rightChild(nodeIndex)
|
||||
)
|
||||
) {
|
||||
const leftIndex = this.getLeftChildIndex(nodeIndex);
|
||||
const rightIndex = this.getRightChildIndex(nodeIndex);
|
||||
const left = this.leftChild(nodeIndex);
|
||||
const right = this.rightChild(nodeIndex);
|
||||
|
||||
if (this.hasLeftChild(nodeIndex) && this.hasRightChild(nodeIndex)) {
|
||||
if (left >= right) {
|
||||
this.swap(leftIndex, nodeIndex);
|
||||
nodeIndex = leftIndex;
|
||||
} else {
|
||||
this.swap(rightIndex, nodeIndex);
|
||||
nodeIndex = rightIndex;
|
||||
}
|
||||
} else if (this.hasLeftChild(nodeIndex)) {
|
||||
this.swap(leftIndex, nodeIndex);
|
||||
nodeIndex = leftIndex;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
getLeftChildIndex(parentIndex) {
|
||||
return (2 * parentIndex) + 1;
|
||||
}
|
||||
|
||||
getRightChildIndex(parentIndex) {
|
||||
return (2 * parentIndex) + 2;
|
||||
}
|
||||
|
||||
getParentIndex(childIndex) {
|
||||
return Math.floor((childIndex - 1) / 2);
|
||||
}
|
||||
|
||||
hasLeftChild(parentIndex) {
|
||||
return this.getLeftChildIndex(parentIndex) < this.heap.length;
|
||||
}
|
||||
|
||||
hasRightChild(parentIndex) {
|
||||
return this.getRightChildIndex(parentIndex) < this.heap.length;
|
||||
}
|
||||
|
||||
leftChild(parentIndex) {
|
||||
return this.heap[this.getLeftChildIndex(parentIndex)];
|
||||
}
|
||||
|
||||
rightChild(parentIndex) {
|
||||
return this.heap[this.getRightChildIndex(parentIndex)];
|
||||
}
|
||||
|
||||
swap(indexOne, indexTwo) {
|
||||
const tmp = this.heap[indexTwo];
|
||||
this.heap[indexTwo] = this.heap[indexOne];
|
||||
this.heap[indexOne] = tmp;
|
||||
}
|
||||
}
|
||||
|
||||
export default MaxHeapAdhoc;
|
||||
117
src/data-structures/heap/MinHeapAdhoc.js
Normal file
117
src/data-structures/heap/MinHeapAdhoc.js
Normal file
@ -0,0 +1,117 @@
|
||||
/**
|
||||
* The minimalistic (ad hoc) version of a MinHeap data structure that doesn't have
|
||||
* external dependencies and that is easy to copy-paste and use during the
|
||||
* coding interview if allowed by the interviewer (since many data
|
||||
* structures in JS are missing).
|
||||
*/
|
||||
class MinHeapAdhoc {
|
||||
constructor(heap = []) {
|
||||
this.heap = [];
|
||||
heap.forEach(this.add);
|
||||
}
|
||||
|
||||
add(num) {
|
||||
this.heap.push(num);
|
||||
this.heapifyUp();
|
||||
}
|
||||
|
||||
peek() {
|
||||
return this.heap[0];
|
||||
}
|
||||
|
||||
poll() {
|
||||
if (this.heap.length === 0) return undefined;
|
||||
const top = this.heap[0];
|
||||
this.heap[0] = this.heap[this.heap.length - 1];
|
||||
this.heap.pop();
|
||||
this.heapifyDown();
|
||||
return top;
|
||||
}
|
||||
|
||||
isEmpty() {
|
||||
return this.heap.length === 0;
|
||||
}
|
||||
|
||||
toString() {
|
||||
return this.heap.join(',');
|
||||
}
|
||||
|
||||
heapifyUp() {
|
||||
let nodeIndex = this.heap.length - 1;
|
||||
while (nodeIndex > 0) {
|
||||
const parentIndex = this.getParentIndex(nodeIndex);
|
||||
if (this.heap[parentIndex] <= this.heap[nodeIndex]) break;
|
||||
this.swap(parentIndex, nodeIndex);
|
||||
nodeIndex = parentIndex;
|
||||
}
|
||||
}
|
||||
|
||||
heapifyDown() {
|
||||
let nodeIndex = 0;
|
||||
|
||||
while (
|
||||
(
|
||||
this.hasLeftChild(nodeIndex)
|
||||
&& this.heap[nodeIndex] > this.leftChild(nodeIndex)
|
||||
)
|
||||
|| (
|
||||
this.hasRightChild(nodeIndex)
|
||||
&& this.heap[nodeIndex] > this.rightChild(nodeIndex)
|
||||
)
|
||||
) {
|
||||
const leftIndex = this.getLeftChildIndex(nodeIndex);
|
||||
const rightIndex = this.getRightChildIndex(nodeIndex);
|
||||
const left = this.leftChild(nodeIndex);
|
||||
const right = this.rightChild(nodeIndex);
|
||||
|
||||
if (this.hasLeftChild(nodeIndex) && this.hasRightChild(nodeIndex)) {
|
||||
if (left <= right) {
|
||||
this.swap(leftIndex, nodeIndex);
|
||||
nodeIndex = leftIndex;
|
||||
} else {
|
||||
this.swap(rightIndex, nodeIndex);
|
||||
nodeIndex = rightIndex;
|
||||
}
|
||||
} else if (this.hasLeftChild(nodeIndex)) {
|
||||
this.swap(leftIndex, nodeIndex);
|
||||
nodeIndex = leftIndex;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
getLeftChildIndex(parentIndex) {
|
||||
return 2 * parentIndex + 1;
|
||||
}
|
||||
|
||||
getRightChildIndex(parentIndex) {
|
||||
return 2 * parentIndex + 2;
|
||||
}
|
||||
|
||||
getParentIndex(childIndex) {
|
||||
return Math.floor((childIndex - 1) / 2);
|
||||
}
|
||||
|
||||
hasLeftChild(parentIndex) {
|
||||
return this.getLeftChildIndex(parentIndex) < this.heap.length;
|
||||
}
|
||||
|
||||
hasRightChild(parentIndex) {
|
||||
return this.getRightChildIndex(parentIndex) < this.heap.length;
|
||||
}
|
||||
|
||||
leftChild(parentIndex) {
|
||||
return this.heap[this.getLeftChildIndex(parentIndex)];
|
||||
}
|
||||
|
||||
rightChild(parentIndex) {
|
||||
return this.heap[this.getRightChildIndex(parentIndex)];
|
||||
}
|
||||
|
||||
swap(indexOne, indexTwo) {
|
||||
const tmp = this.heap[indexTwo];
|
||||
this.heap[indexTwo] = this.heap[indexOne];
|
||||
this.heap[indexOne] = tmp;
|
||||
}
|
||||
}
|
||||
|
||||
export default MinHeapAdhoc;
|
||||
@ -33,6 +33,36 @@ to the key of `C`
|
||||
The node at the "top" of the heap with no parents is
|
||||
called the root node.
|
||||
|
||||
## Time Complexities
|
||||
|
||||
Here are time complexities of various heap data structures. Function names assume a max-heap.
|
||||
|
||||
| Operation | find-max | delete-max | insert| increase-key| meld |
|
||||
| --------- | -------- | ---------- | ----- | ----------- | ---- |
|
||||
| [Binary](https://en.wikipedia.org/wiki/Binary_heap) | `Θ(1)` | `Θ(log n)` | `O(log n)` | `O(log n)` | `Θ(n)` |
|
||||
| [Leftist](https://en.wikipedia.org/wiki/Leftist_tree) | `Θ(1)` | `Θ(log n)` | `Θ(log n)` | `O(log n)` | `Θ(log n)` |
|
||||
| [Binomial](https://en.wikipedia.org/wiki/Binomial_heap) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `O(log n)` | `O(log n)` |
|
||||
| [Fibonacci](https://en.wikipedia.org/wiki/Fibonacci_heap) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `Θ(1)` | `Θ(1)` |
|
||||
| [Pairing](https://en.wikipedia.org/wiki/Pairing_heap) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `o(log n)` | `Θ(1)` |
|
||||
| [Brodal](https://en.wikipedia.org/wiki/Brodal_queue) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `Θ(1)` | `Θ(1)` |
|
||||
| [Rank-pairing](https://en.wikipedia.org/w/index.php?title=Rank-pairing_heap&action=edit&redlink=1) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `Θ(1)` | `Θ(1)` |
|
||||
| [Strict Fibonacci](https://en.wikipedia.org/wiki/Fibonacci_heap) | `Θ(1)` | `Θ(log n)` | `Θ(1)` | `Θ(1)` | `Θ(1)` |
|
||||
| [2-3 heap](https://en.wikipedia.org/wiki/2%E2%80%933_heap) | `O(log n)` | `O(log n)` | `O(log n)` | `Θ(1)` | `?` |
|
||||
|
||||
Where:
|
||||
- **find-max (or find-min):** find a maximum item of a max-heap, or a minimum item of a min-heap, respectively (a.k.a. *peek*)
|
||||
- **delete-max (or delete-min):** removing the root node of a max heap (or min heap), respectively
|
||||
- **insert:** adding a new key to the heap (a.k.a., *push*)
|
||||
- **increase-key or decrease-key:** updating a key within a max- or min-heap, respectively
|
||||
- **meld:** joining two heaps to form a valid new heap containing all the elements of both, destroying the original heaps.
|
||||
|
||||
> In this repository, the [MaxHeap.js](./MaxHeap.js) and [MinHeap.js](./MinHeap.js) are examples of the **Binary** heap.
|
||||
|
||||
## Implementation
|
||||
|
||||
- [MaxHeap.js](./MaxHeap.js) and [MinHeap.js](./MinHeap.js)
|
||||
- [MaxHeapAdhoc.js](./MaxHeapAdhoc.js) and [MinHeapAdhoc.js](./MinHeapAdhoc.js) - The minimalistic (ad hoc) version of a MinHeap/MaxHeap data structure that doesn't have external dependencies and that is easy to copy-paste and use during the coding interview if allowed by the interviewer (since many data structures in JS are missing).
|
||||
|
||||
## References
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))
|
||||
|
||||
91
src/data-structures/heap/__test__/MaxHeapAdhoc.test.js
Normal file
91
src/data-structures/heap/__test__/MaxHeapAdhoc.test.js
Normal file
@ -0,0 +1,91 @@
|
||||
import MaxHeap from '../MaxHeapAdhoc';
|
||||
|
||||
describe('MaxHeapAdhoc', () => {
|
||||
it('should create an empty max heap', () => {
|
||||
const maxHeap = new MaxHeap();
|
||||
|
||||
expect(maxHeap).toBeDefined();
|
||||
expect(maxHeap.peek()).toBe(undefined);
|
||||
expect(maxHeap.isEmpty()).toBe(true);
|
||||
});
|
||||
|
||||
it('should add items to the heap and heapify it up', () => {
|
||||
const maxHeap = new MaxHeap();
|
||||
|
||||
maxHeap.add(5);
|
||||
expect(maxHeap.isEmpty()).toBe(false);
|
||||
expect(maxHeap.peek()).toBe(5);
|
||||
expect(maxHeap.toString()).toBe('5');
|
||||
|
||||
maxHeap.add(3);
|
||||
expect(maxHeap.peek()).toBe(5);
|
||||
expect(maxHeap.toString()).toBe('5,3');
|
||||
|
||||
maxHeap.add(10);
|
||||
expect(maxHeap.peek()).toBe(10);
|
||||
expect(maxHeap.toString()).toBe('10,3,5');
|
||||
|
||||
maxHeap.add(1);
|
||||
expect(maxHeap.peek()).toBe(10);
|
||||
expect(maxHeap.toString()).toBe('10,3,5,1');
|
||||
|
||||
maxHeap.add(1);
|
||||
expect(maxHeap.peek()).toBe(10);
|
||||
expect(maxHeap.toString()).toBe('10,3,5,1,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(10);
|
||||
expect(maxHeap.toString()).toBe('5,3,1,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(5);
|
||||
expect(maxHeap.toString()).toBe('3,1,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(3);
|
||||
expect(maxHeap.toString()).toBe('1,1');
|
||||
});
|
||||
|
||||
it('should poll items from the heap and heapify it down', () => {
|
||||
const maxHeap = new MaxHeap();
|
||||
|
||||
maxHeap.add(5);
|
||||
maxHeap.add(3);
|
||||
maxHeap.add(10);
|
||||
maxHeap.add(11);
|
||||
maxHeap.add(1);
|
||||
|
||||
expect(maxHeap.toString()).toBe('11,10,5,3,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(11);
|
||||
expect(maxHeap.toString()).toBe('10,3,5,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(10);
|
||||
expect(maxHeap.toString()).toBe('5,3,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(5);
|
||||
expect(maxHeap.toString()).toBe('3,1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(3);
|
||||
expect(maxHeap.toString()).toBe('1');
|
||||
|
||||
expect(maxHeap.poll()).toBe(1);
|
||||
expect(maxHeap.toString()).toBe('');
|
||||
|
||||
expect(maxHeap.poll()).toBe(undefined);
|
||||
expect(maxHeap.toString()).toBe('');
|
||||
});
|
||||
|
||||
it('should heapify down through the right branch as well', () => {
|
||||
const maxHeap = new MaxHeap();
|
||||
|
||||
maxHeap.add(3);
|
||||
maxHeap.add(12);
|
||||
maxHeap.add(10);
|
||||
|
||||
expect(maxHeap.toString()).toBe('12,3,10');
|
||||
|
||||
maxHeap.add(11);
|
||||
expect(maxHeap.toString()).toBe('12,11,10,3');
|
||||
|
||||
expect(maxHeap.poll()).toBe(12);
|
||||
expect(maxHeap.toString()).toBe('11,3,10');
|
||||
});
|
||||
});
|
||||
91
src/data-structures/heap/__test__/MinHeapAdhoc.test.js
Normal file
91
src/data-structures/heap/__test__/MinHeapAdhoc.test.js
Normal file
@ -0,0 +1,91 @@
|
||||
import MinHeapAdhoc from '../MinHeapAdhoc';
|
||||
|
||||
describe('MinHeapAdhoc', () => {
|
||||
it('should create an empty min heap', () => {
|
||||
const minHeap = new MinHeapAdhoc();
|
||||
|
||||
expect(minHeap).toBeDefined();
|
||||
expect(minHeap.peek()).toBe(undefined);
|
||||
expect(minHeap.isEmpty()).toBe(true);
|
||||
});
|
||||
|
||||
it('should add items to the heap and heapify it up', () => {
|
||||
const minHeap = new MinHeapAdhoc();
|
||||
|
||||
minHeap.add(5);
|
||||
expect(minHeap.isEmpty()).toBe(false);
|
||||
expect(minHeap.peek()).toBe(5);
|
||||
expect(minHeap.toString()).toBe('5');
|
||||
|
||||
minHeap.add(3);
|
||||
expect(minHeap.peek()).toBe(3);
|
||||
expect(minHeap.toString()).toBe('3,5');
|
||||
|
||||
minHeap.add(10);
|
||||
expect(minHeap.peek()).toBe(3);
|
||||
expect(minHeap.toString()).toBe('3,5,10');
|
||||
|
||||
minHeap.add(1);
|
||||
expect(minHeap.peek()).toBe(1);
|
||||
expect(minHeap.toString()).toBe('1,3,10,5');
|
||||
|
||||
minHeap.add(1);
|
||||
expect(minHeap.peek()).toBe(1);
|
||||
expect(minHeap.toString()).toBe('1,1,10,5,3');
|
||||
|
||||
expect(minHeap.poll()).toBe(1);
|
||||
expect(minHeap.toString()).toBe('1,3,10,5');
|
||||
|
||||
expect(minHeap.poll()).toBe(1);
|
||||
expect(minHeap.toString()).toBe('3,5,10');
|
||||
|
||||
expect(minHeap.poll()).toBe(3);
|
||||
expect(minHeap.toString()).toBe('5,10');
|
||||
});
|
||||
|
||||
it('should poll items from the heap and heapify it down', () => {
|
||||
const minHeap = new MinHeapAdhoc();
|
||||
|
||||
minHeap.add(5);
|
||||
minHeap.add(3);
|
||||
minHeap.add(10);
|
||||
minHeap.add(11);
|
||||
minHeap.add(1);
|
||||
|
||||
expect(minHeap.toString()).toBe('1,3,10,11,5');
|
||||
|
||||
expect(minHeap.poll()).toBe(1);
|
||||
expect(minHeap.toString()).toBe('3,5,10,11');
|
||||
|
||||
expect(minHeap.poll()).toBe(3);
|
||||
expect(minHeap.toString()).toBe('5,11,10');
|
||||
|
||||
expect(minHeap.poll()).toBe(5);
|
||||
expect(minHeap.toString()).toBe('10,11');
|
||||
|
||||
expect(minHeap.poll()).toBe(10);
|
||||
expect(minHeap.toString()).toBe('11');
|
||||
|
||||
expect(minHeap.poll()).toBe(11);
|
||||
expect(minHeap.toString()).toBe('');
|
||||
|
||||
expect(minHeap.poll()).toBe(undefined);
|
||||
expect(minHeap.toString()).toBe('');
|
||||
});
|
||||
|
||||
it('should heapify down through the right branch as well', () => {
|
||||
const minHeap = new MinHeapAdhoc();
|
||||
|
||||
minHeap.add(3);
|
||||
minHeap.add(12);
|
||||
minHeap.add(10);
|
||||
|
||||
expect(minHeap.toString()).toBe('3,12,10');
|
||||
|
||||
minHeap.add(11);
|
||||
expect(minHeap.toString()).toBe('3,11,10,12');
|
||||
|
||||
expect(minHeap.poll()).toBe(3);
|
||||
expect(minHeap.toString()).toBe('10,11,12');
|
||||
});
|
||||
});
|
||||
@ -7,7 +7,7 @@ _Read this in other languages:_
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Turkish_](README.tr-TR.md),
|
||||
[_Türkçe_](README.tr-TR.md),
|
||||
[_Українська_](README.uk-UA.md)
|
||||
|
||||
In computer science, a **linked list** is a linear collection
|
||||
|
||||
@ -1,10 +1,10 @@
|
||||
# Зв'язаний список
|
||||
|
||||
Зв'язаний список — базова динамічна структура даних в інформатиці, що складається з вузлів, кожен з яких містить як дані, так посилання («зв'язку») на наступний вузол списку. Дана структура дозволяє ефективно додавати та видаляти елементи на довільній позиції у послідовності у процесі ітерації. Більш складні варіанти включають додаткові посилання, що дозволяють ефективно додавати та видаляти довільні елементи.
|
||||
Зв'язаний список — базова динамічна структура даних в інформатиці, що складається з вузлів, кожен з яких містить як дані, так і посилання («зв'язку») на наступний вузол списку. Ця структура даних дозволяє ефективно додавати та видаляти елементи на довільній позиції у послідовності у процесі ітерації. Більш складні варіанти включають додаткові посилання, що дозволяють ефективно додавати та видаляти довільні елементи.
|
||||
|
||||
Принциповою перевагою перед масивом є структурна гнучкість: порядок елементів зв'язкового списку може збігатися з порядком розташування елементів даних у пам'яті комп'ютера, а порядок обходу списку завжди явно задається його внутрішніми зв'язками. Суть переваги у тому, що у багатьох мовах створення масиву вимагає вказати його заздалегідь. Зв'язковий список дозволяє обійти це обмеження.
|
||||
Принциповою перевагою перед масивом є структурна гнучкість: порядок елементів зв'язаного списку може збігатися з порядком розташування елементів даних у пам'яті комп'ютера, а порядок обходу списку завжди явно задається його внутрішніми зв'язками. Це важливо, бо у багатьох мовах створення масиву вимагає вказати його розмір заздалегідь. Зв'язаний список дозволяє обійти це обмеження.
|
||||
|
||||
Недоліком зв'язкових списків є те, що час доступу є лінійним (і важко для реалізації конвеєрів). Неможливий швидкий доступ (випадковий).
|
||||
Недоліком зв'язаних списків є те, що час доступу є лінійним (і важко для реалізації конвеєрів). Неможливий швидкий доступ (випадковий).
|
||||
|
||||
|
||||
|
||||
@ -17,7 +17,7 @@
|
||||
```text
|
||||
Add(value)
|
||||
Pre: value - значення, що додається
|
||||
Post: value поміщено в кінець списку
|
||||
Post: value додано в кінець списку
|
||||
n ← node(value)
|
||||
if head = ø
|
||||
head ← n
|
||||
@ -32,7 +32,7 @@ end Add
|
||||
```text
|
||||
Prepend(value)
|
||||
Pre: value - значення, що додається
|
||||
Post: value поміщено на початок списку
|
||||
Post: value додано на початку списку
|
||||
n ← node(value)
|
||||
n.next ← head
|
||||
head ← n
|
||||
@ -42,7 +42,7 @@ Prepend(value)
|
||||
end Prepend
|
||||
```
|
||||
|
||||
### Поиск
|
||||
### Пошук
|
||||
|
||||
```text
|
||||
Contains(head, value)
|
||||
@ -60,7 +60,7 @@ Contains(head, value)
|
||||
end Contains
|
||||
```
|
||||
|
||||
### Вилучення
|
||||
### Видалення
|
||||
|
||||
```text
|
||||
Remove(head, value)
|
||||
@ -94,7 +94,7 @@ Remove(head, value)
|
||||
end Remove
|
||||
```
|
||||
|
||||
### Обход
|
||||
### Обхід
|
||||
|
||||
```text
|
||||
Traverse(head)
|
||||
@ -108,12 +108,12 @@ Traverse(head)
|
||||
end Traverse
|
||||
```
|
||||
|
||||
### Зворотний обхід
|
||||
### Зворотній обхід
|
||||
|
||||
```text
|
||||
ReverseTraversal(head, tail)
|
||||
Pre: head и tail відносяться до одного списку
|
||||
Post: елементи списку пройдено у зворотному порядку
|
||||
Pre: head і tail відносяться до одного списку
|
||||
Post: елементи списку пройдено у зворотньому порядку
|
||||
if tail != ø
|
||||
curr ← tail
|
||||
while curr != head
|
||||
@ -131,7 +131,7 @@ end ReverseTraversal
|
||||
|
||||
## Складність
|
||||
|
||||
### Тимчасова складність
|
||||
### Часова складність
|
||||
|
||||
| Читання | Пошук | Вставка | Вилучення |
|
||||
| :--------: | :-------: | :--------: | :-------: |
|
||||
@ -143,5 +143,5 @@ O(n)
|
||||
|
||||
## Посилання
|
||||
|
||||
- [Wikipedia](https://uk.wikipedia.org/wiki/%D0%97%D0%B2%27%D1%8F%D0%B7%D0%B0%D0%BD%D0%B8%D0%B9_%D1%81%D0%BF%D0%B8%D1%81%D0%BE%D0%BA)
|
||||
- [Wikipedia](https://uk.wikipedia.org/wiki/Зв'язаний_список)
|
||||
- [YouTube](https://www.youtube.com/watch?v=6snsMa4E1Os)
|
||||
|
||||
155
src/data-structures/linked-list/README.vi-VN.md
Normal file
155
src/data-structures/linked-list/README.vi-VN.md
Normal file
@ -0,0 +1,155 @@
|
||||
# Danh sách liên kết (Linked List)
|
||||
|
||||
_Đọc bằng ngôn ngữ khác:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_日本語_](README.ja-JP.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Türkçe_](README.tr-TR.md),
|
||||
[_Українська_](README.uk-UA.md)
|
||||
|
||||
|
||||
Trong khoa học máy tính, một danh sách liên kết là một bộ sưu tập tuyến tính
|
||||
các phần tử dữ liệu, trong đó thứ tự tuyến tính không được xác định bởi
|
||||
vị trí vật lý của chúng trong bộ nhớ. Thay vào đó, mỗi
|
||||
phần tử trỏ đến phần tử tiếp theo. Đây là một cấu trúc dữ liệu
|
||||
bao gồm một nhóm các nút cùng đại diện cho
|
||||
một chuỗi. Dưới dạng đơn giản nhất, mỗi nút
|
||||
bao gồm dữ liệu và một tham chiếu (nói cách khác,
|
||||
một liên kết) đến nút tiếp theo trong chuỗi. Cấu trúc này
|
||||
cho phép việc chèn hoặc loại bỏ các phần tử một cách hiệu quả
|
||||
từ bất kỳ vị trí nào trong chuỗi trong quá trình lặp.
|
||||
Các biến thể phức tạp hơn thêm các liên kết bổ sung, cho phép
|
||||
việc chèn hoặc loại bỏ một cách hiệu quả từ bất kỳ phần tử nào
|
||||
trong chuỗi dựa trên tham chiếu. Một nhược điểm của danh sách liên kết
|
||||
là thời gian truy cập tuyến tính (và khó điều chỉnh). Truy cập nhanh hơn,
|
||||
như truy cập ngẫu nhiên, là không khả thi. Mảng
|
||||
có độ tương phản cache tốt hơn so với danh sách liên kết.
|
||||
|
||||
|
||||
*Được làm từ [okso.app](https://okso.app)*
|
||||
|
||||
## Mã giải (Pseudocode) cho Các Hoạt Động Cơ Bản
|
||||
*head = đầu,
|
||||
*tail = đuôi,
|
||||
*next = kế tiếp,
|
||||
*node = nút,
|
||||
*value = giá trị
|
||||
|
||||
### Chèn (Insert)
|
||||
|
||||
```
|
||||
ThêmGiáTrị(giá trị) (Add(value))
|
||||
Trước(Pre): giá trị là giá trị muốn thêm vào danh sách
|
||||
Sau(Post): giá trị đã được đặt ở cuối danh sách
|
||||
|
||||
n ← node(value)
|
||||
if head = ø
|
||||
head ← n
|
||||
tail ← n
|
||||
else
|
||||
tail.next ← n
|
||||
tail ← n
|
||||
end if
|
||||
end ThêmGiáTrị(Add)
|
||||
```
|
||||
|
||||
```
|
||||
ChènVàoĐầu(giá trị)
|
||||
Trước(Pre): giá trị là giá trị muốn thêm vào danh sách
|
||||
Sau(Post): giá trị đã được đặt ở đầu danh sách
|
||||
|
||||
n ← node(value)
|
||||
n.next ← head
|
||||
head ← n
|
||||
if tail = ø
|
||||
tail ← n
|
||||
end
|
||||
end ChènVàoĐầu
|
||||
```
|
||||
|
||||
### Tìm Kiếm (Search)
|
||||
```
|
||||
Chứa(đầu, giá trị)
|
||||
Trước: đầu là nút đầu trong danh sách
|
||||
giá trị là giá trị cần tìm kiếm
|
||||
Sau: mục đó có thể ở trong danh sách liên kết, true; nếu không, là false
|
||||
n ← head
|
||||
while n != ø and n.value != value
|
||||
n ← n.next
|
||||
end while
|
||||
if n = ø
|
||||
return false
|
||||
end if
|
||||
return true
|
||||
end Contains
|
||||
```
|
||||
|
||||
### Xóa (Delete)
|
||||
```
|
||||
Xóa(đầu, giá trị)
|
||||
Trước: đầu là nút đầu trong danh sách
|
||||
giá trị là giá trị cần xóa khỏi danh sách
|
||||
Sau: giá trị đã được xóa khỏi danh sách, true; nếu không, là false
|
||||
if head = ø
|
||||
return false
|
||||
end if
|
||||
n ← head
|
||||
if n.value = value
|
||||
if head = tail
|
||||
head ← ø
|
||||
tail ← ø
|
||||
else
|
||||
head ← head.next
|
||||
end if
|
||||
return true
|
||||
end if
|
||||
while n.next != ø and n.next.value != value
|
||||
n ← n.next
|
||||
end while
|
||||
if n.next != ø
|
||||
if n.next = tail
|
||||
tail ← n
|
||||
tail.next = null
|
||||
else
|
||||
n.next ← n.next.next
|
||||
end if
|
||||
return true
|
||||
end if
|
||||
return false
|
||||
end Remove
|
||||
```
|
||||
|
||||
### Duyệt(raverse)
|
||||
Duyệt(đầu)
|
||||
Trước: đầu là nút đầu trong danh sách
|
||||
Sau: các mục trong danh sách đã được duyệt
|
||||
n ← head
|
||||
while n != ø
|
||||
yield n.value
|
||||
n ← n.next
|
||||
end while
|
||||
end Traverse
|
||||
|
||||
### Duyệt Ngược (Traverse in Reverse)
|
||||
DuyệtNgược(đầu, đuôi)
|
||||
Trước: đầu và đuôi thuộc cùng một danh sách
|
||||
Sau: các mục trong danh sách đã được duyệt theo thứ tự ngược lại
|
||||
|
||||
## Độ Phức Tạp
|
||||
|
||||
### Độ Phức Tạp Thời Gian (Time Complexity)
|
||||
|
||||
| Access | Search | Insertion | Deletion |
|
||||
| :-------: | :-------: | :-------: | :-------: |
|
||||
| O(n) | O(n) | O(1) | O(n) |
|
||||
|
||||
## Độ Phức Tạp Không Gian (Space Complexity)
|
||||
O(n)
|
||||
|
||||
## Tham Khảo
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Linked_list)
|
||||
- [YouTube](https://www.youtube.com/watch?v=njTh_OwMljA&index=2&t=1s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
|
||||
22
src/data-structures/queue/README.vi-VN.md
Normal file
22
src/data-structures/queue/README.vi-VN.md
Normal file
@ -0,0 +1,22 @@
|
||||
# Hàng đợi (Queue)
|
||||
|
||||
_Đọc bằng ngôn ngữ khác:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_日本語_](README.ja-JP.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Українська_](README.uk-UA.md)
|
||||
|
||||
Trong khoa học máy tính, một **hàng đợi** là một loại cụ thể của kiểu dữ liệu trừu tượng hoặc bộ sưu tập trong đó các phần tử trong bộ sưu tập được giữ theo thứ tự và nguyên tắc (hoặc chỉ) các hoạt động trên bộ sưu tập là thêm các phần tử vào vị trí cuối cùng, được gọi là đưa vào hàng đợi (enqueue), và loại bỏ các phần tử từ vị trí đầu tiên, được gọi là đưa ra khỏi hàng đợi (dequeue). Điều này khiến cho hàng đợi trở thành một cấu trúc dữ liệu First-In-First-Out (FIFO). Trong cấu trúc dữ liệu FIFO, phần tử đầu tiên được thêm vào hàng đợi sẽ là phần tử đầu tiên được loại bỏ. Điều này tương đương với yêu cầu rằng sau khi một phần tử mới được thêm vào, tất cả các phần tử đã được thêm vào trước đó phải được loại bỏ trước khi có thể loại bỏ phần tử mới. Thường thì cũng có thêm một hoạt động nhìn hay lấy phần đầu, trả về giá trị của phần tử đầu tiên mà không loại bỏ nó. Hàng đợi là một ví dụ về cấu trúc dữ liệu tuyến tính, hoặc trừu tượng hơn là một bộ sưu tập tuần tự.
|
||||
|
||||
Hàng đợi FIFO (First-In-First-Out) có thể được biểu diễn như sau:
|
||||
|
||||
|
||||
|
||||
*Made with [okso.app](https://okso.app)*
|
||||
|
||||
## Tham Khảo
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))
|
||||
- [YouTube](https://www.youtube.com/watch?v=wjI1WNcIntg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=3&)
|
||||
27
src/data-structures/stack/README.vi-VN.md
Normal file
27
src/data-structures/stack/README.vi-VN.md
Normal file
@ -0,0 +1,27 @@
|
||||
# Ngăn xếp (stack)
|
||||
|
||||
_Đọc bằng ngôn ngữ khác:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_日本語_](README.ja-JP.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Українська_](README.uk-UA.md)
|
||||
|
||||
Trong khoa học máy tính, một ngăn xếp (stack) là một kiểu dữ liệu trừu tượng phục vụ như một bộ sưu tập các phần tử, với hai hoạt động chính:
|
||||
|
||||
đẩy (push), thêm một phần tử vào bộ sưu tập, và
|
||||
lấy (pop), loại bỏ phần tử được thêm gần nhất mà chưa được loại bỏ.
|
||||
Thứ tự mà các phần tử được lấy ra khỏi ngăn xếp dẫn đến tên gọi thay thế của nó, là LIFO (last in, first out). Ngoài ra, một hoạt động nhìn có thể cung cấp quyền truy cập vào phần trên mà không làm thay đổi ngăn xếp. Tên "ngăn xếp" cho loại cấu trúc này đến từ sự tương tự với một bộ sưu tập các vật phẩm vật lý được xếp chồng lên nhau, điều này làm cho việc lấy một vật phẩm ra khỏi đỉnh của ngăn xếp dễ dàng, trong khi để đến được một vật phẩm sâu hơn trong ngăn xếp có thể đòi hỏi việc lấy ra nhiều vật phẩm khác trước đó.
|
||||
|
||||
Biểu diễn đơn giản về thời gian chạy của một ngăn xếp với các hoạt động đẩy và lấy.
|
||||
|
||||
|
||||
|
||||
*Made with [okso.app](https://okso.app)*
|
||||
|
||||
## Tham Khảo
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Linked_list)
|
||||
- [YouTube](https://www.youtube.com/watch?v=njTh_OwMljA&index=2&t=1s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
|
||||
@ -23,7 +23,7 @@ together with a list of references to nodes (the "children"),
|
||||
with the constraints that no reference is duplicated, and none
|
||||
points to the root.
|
||||
|
||||
A simple unordered tree; in this diagram, the node labeled 7 has
|
||||
A simple unordered tree; in this diagram, the node labeled 3 has
|
||||
two children, labeled 2 and 6, and one parent, labeled 2. The
|
||||
root node, at the top, has no parent.
|
||||
|
||||
|
||||
19
src/data-structures/trie/README.ko-KO.md
Normal file
19
src/data-structures/trie/README.ko-KO.md
Normal file
@ -0,0 +1,19 @@
|
||||
# Trie
|
||||
|
||||
_Read this in other languages:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_한국어_](README.ko-KO.md)
|
||||
|
||||
컴퓨터 과학에서 **트라이**는 디지털 트리라고도 불리며 때로는 기수 트리 또는 접두사 트리(접두사로 검색할 수 있기 때문에)라고도 불리며 일종의 검색 트리입니다. 키가 보통 문자열인 동적 집합 또는 연관 배열을 저장하는 데 사용되는 순서가 지정된 트리 데이터 구조입니다. 이진 검색 트리와 달리 트리의 어떤 노드도 해당 노드와 연결된 키를 저장하지 않으며 대신 트리의 위치가 해당 노드와 연결된 키를 정의합니다. 노드의 모든 하위 항목은 해당 노드와 연결된 문자열의 공통 접두사를 가지며 루트는 빈 문자열과 연결됩니다. 값은 모든 노드와 반드시 연결되지는 않습니다. 오히려 값은 나뭇잎과 관심 있는 키에 해당하는 일부 내부 노드에만 연결되는 경향이 있습니다. 접두사 트리의 공간에 최적화된 표현은 콤팩트 접두사 트리를 참조하십시오.
|
||||
|
||||
|
||||
|
||||
_Made with [okso.app](https://okso.app)_
|
||||
|
||||
## 참조
|
||||
|
||||
- [Wikipedia](<https://ko.wikipedia.org/wiki/%ED%8A%B8%EB%9D%BC%EC%9D%B4_(%EC%BB%B4%ED%93%A8%ED%8C%85)>)
|
||||
- [YouTube](https://www.youtube.com/watch?v=zIjfhVPRZCg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=7&t=0s)
|
||||
@ -4,7 +4,8 @@ _Read this in other languages:_
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_Русский_](README.ru-RU.md),
|
||||
[_Português_](README.pt-BR.md),
|
||||
[_Українська_](README.uk-UA.md)
|
||||
[_Українська_](README.uk-UA.md),
|
||||
[_한국어_](README.ko-KO.md)
|
||||
|
||||
In computer science, a **trie**, also called digital tree and sometimes
|
||||
radix tree or prefix tree (as they can be searched by prefixes),
|
||||
|
||||
Loading…
Reference in New Issue
Block a user