Expand description
§rust-algorithms
Data Structures & Algorithms (DSA) darsligining ishlaydigan kod qismi.
Har bir modul bitta mavzuga to’g’ri keladi va repozitoriydagi
raqamlangan papkalardagi darslik (.md) fayllari bilan juftlashgan:
| Modul | Darslik |
|---|---|
numbers | 02-numbers/ |
searching | 03-searching/ |
sorting | 04-sorting/ |
data_structures | 05-data-structures/ |
linked_list | 06-linked-list/ |
tree | 07-trees/ |
graph | 08-graphs/ |
greedy | 09-greedy/ |
dp | 10-dynamic-programming/ |
other | 11-other-algorithms/ |
§Tez boshlash
use rust_algorithms::searching::binary_search;
use rust_algorithms::sorting::quick_sort;
let mut v = vec![5, 3, 9, 1, 7];
quick_sort(&mut v);
assert_eq!(v, [1, 3, 5, 7, 9]);
assert_eq!(binary_search(&v, &7), Some(3));§Kodni o’qish tartibi
Har bir funksiya ustida quyidagi izohlar bor:
- G’oya — algoritm nima qilyapti (bir jumlada);
- Time / Space — murakkablik;
- Misol —
cargo testbilan tekshiriladigan ishlaydigan namuna.
Modules§
- data_
structures - Ma’lumotlar strukturalari (Data Structures)
- dp
- Dinamik dasturlash (Dynamic Programming)
- graph
- Graflar (Graphs)
- greedy
- Ochko’z algoritmlar (Greedy)
- linked_
list - Linked List (bog’langan ro’yxat)
- numbers
- Sonlar bilan ishlash algoritmlari
- other
- Boshqa muhim algoritmlar
- searching
- Qidiruv algoritmlari (Searching)
- sorting
- Tartiblash algoritmlari (Sorting)
- tree
- Daraxtlar (Trees)
- util
- Yordamchi vositalar: kichik tasodifiy sonlar generatori va vaqt o’lchagich.