ismoilovdevml · ismoilovdevml · Mar 12, 2023 · Mar 12, 2023 · Mar 12, 2023
diff --git a/big-o/Cargo.lock → 01.Big O notation/Cargo.lock b/big-o/Cargo.lock → 01.Big O notation/Cargo.lock
diff --git a/big-o/Cargo.toml → 01.Big O notation/Cargo.toml b/big-o/Cargo.toml → 01.Big O notation/Cargo.toml
diff --git a/01.Big O notation/big-o-notation.md b/01.Big O notation/big-o-notation.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Big O notation - Katta O belgisi</b></h1>
diff --git a/big-o/src/main.rs → 01.Big O notation/src/main.rs b/big-o/src/main.rs → 01.Big O notation/src/main.rs
diff --git a/02.Numbers/Numbers.md b/02.Numbers/Numbers.md
@@ -0,0 +1,2 @@
+<h1 align="center" style="color:orange;"><b>Numbers - Sonlar</b></h1>
+
diff --git a/03.Searching Algorithms/Searching Algorithms.md b/03.Searching Algorithms/Searching Algorithms.md
@@ -0,0 +1,2 @@
+<h1 align="center" style="color:orange;"><b>Searching Algorithms - Qidiruv Algoritmlari</b></h1>
+
diff --git a/search-algorithms/binary-search/src/main.rs → 03.Searching Algorithms/src/binary_search.rs b/search-algorithms/binary-search/src/main.rs → 03.Searching Algorithms/src/binary_search.rs
diff --git a/search-algorithms/linear-search/src/main.rs → 03.Searching Algorithms/src/linear_search.rs b/search-algorithms/linear-search/src/main.rs → 03.Searching Algorithms/src/linear_search.rs
diff --git a/bubble_sort/Cargo.lock → 04.Sorting Algorithms/Cargo.lock b/bubble_sort/Cargo.lock → 04.Sorting Algorithms/Cargo.lock
diff --git a/bubble_sort/Cargo.toml → 04.Sorting Algorithms/Cargo.toml b/bubble_sort/Cargo.toml → 04.Sorting Algorithms/Cargo.toml
diff --git a/04.Sorting Algorithms/Sorting Algorithms.md b/04.Sorting Algorithms/Sorting Algorithms.md
@@ -0,0 +1,83 @@
+<h1 align="center" style="color:orange;"><b>Sotring Algorithms - Tartiblash Algoritmlari</b></h1>
+
+Ushbu bo'limda sizlar bilan tartiblash algoritmlarini barcha turlarini ko'rib chiqamiz. Ularni qay o'rinda, qanday ishlatishni va qanday qilib Rust dasturlash tilida kodga o'girishni misollar va qiziqarli yo'llar bilan ko'rib chiqamiz. 
+
+**Tartibalsh Algoritmlar bu quyidagilar:**
+
+1. Bubble sort
+2. Selection sort
+3. Insertion sort
+4. Merge sort
+5. Quick sort
+6. Heap sort
+7. Radix sort
+8. Shell sort
+9. Couting sort
+10. Bucket sort
+
+Ammo biz bularni barchasini o'rganmasakda sizlar bilan eng keraklilarini ko'rib ketamiz.
+
+<h2 align="center"><b>Bubble Sort</b></h2>
+<hr>
+
+Bubble Sort - bu eng oddiy sorting(tartiblash) algoritmi bo'lib, agar ular noto'g'ri tartibda bo'lsa, adjacent elementlarni qayta-qayta almashtirish orqali ishlaydi. Ushbu algoritm katta ma'lumotlar to'plamlari uchun mos emas, chunki uning average va worst-case time(eng yomon vaqt murakkabligi) ancha yuqori. 
+
+Algoritmni qanday ishlashini pastdagi misol orqali ko'rishingiz mumkin:
+
+![alt text](https://www.swtestacademy.com/wp-content/uploads/2021/11/bubble-sort-animation-swtestacademy-bg.gif)
+
+![alt text](https://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif?20131109191607)
+
+Ko'rib turibsizki uning ishlashi juda sodda. Keling endi uni Rustda qanday qilib kod holatiga o'tkazishni ko'rib chiqamiz.
+
+## Rust 
+
+```rust
+fn main() {
+    let mut arr = [4, 7, 9, 1, 2, 3, 0, 8, 5, 6, -3, 234, -23, 11];
+    println!("Tartibisz ro'yxat: {:?}", arr);
+
+    buble_sort(&mut arr);
+    println!("Tartiblangan ro'yxat: {:?}", arr);
+}
+
+pub fn buble_sort(arr: &mut [i32]) {
+    let len = arr.len();
+    for i in 0..len {
+        for j in 0..len-i-1 {
+            if arr[j] > arr[j+1] {
+                arr.swap(j, j + 1);
+            }
+        }
+    }
+}
+```
+
+<br>
+
+<h2 align="center"><b>Selection Sort</b></h2>
+<hr>
+
+Computer scienceda selection sort joyida taqqoslash algoritmi hisoblanadi. U O(n2) time complexity(vaqt murakkabligi)ga ega, bu esa uni katta roʻyxatlarda samarasiz qiladi va odatda similar insertion sortdan koʻra yomonroq ishlaydi. Selection sort o'zining soddaligi bilan ajralib turadi va muayyan vaziyatlarda, ayniqsa yordamchi xotira cheklangan bo'lsa, murakkabroq algoritmlarga nisbatan ishlash afzalliklariga ega.
+
+![alt text](https://www.swtestacademy.com/wp-content/uploads/2021/11/selection-sort-amination.gif)
+
+```rust
+// Bu yerda rust implementation bo'ladi!
+```
+
+<h2 align="center"><b>Insertion Sort</b></h2>
+<hr>
+
+...
+
+
+<h2 align="center"><b>Merge Sort</b></h2>
+<hr>
+
+...
+
+<h2 align="center"><b>Quick Sort</b></h2>
+<hr>
+
+...
diff --git a/bubble_sort/src/main.rs → 04.Sorting Algorithms/src/bubble_sort.rs b/bubble_sort/src/main.rs → 04.Sorting Algorithms/src/bubble_sort.rs
diff --git a/merge_sort/src/main.rs → 04.Sorting Algorithms/src/merge_sort.rs b/merge_sort/src/main.rs → 04.Sorting Algorithms/src/merge_sort.rs
diff --git a/quick-sort/src/main.rs → 04.Sorting Algorithms/src/quick_sort.rs b/quick-sort/src/main.rs → 04.Sorting Algorithms/src/quick_sort.rs
diff --git a/selection-sort/src/main.rs → 04.Sorting Algorithms/src/selection_sort.rs b/selection-sort/src/main.rs → 04.Sorting Algorithms/src/selection_sort.rs
diff --git a/05.Data Structures/Data Structures.md b/05.Data Structures/Data Structures.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Data Structures - Ma'lumot tuzilmalari</b></h1>
diff --git a/06.Linked List/Linked List.md b/06.Linked List/Linked List.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Linked List - Bog'langan List</b></h1>
diff --git a/07.Tree/Tree.md b/07.Tree/Tree.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Tree - Daraxt</b></h1>
diff --git a/08.Graph/Graph.md b/08.Graph/Graph.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Graphs - Grafiklar</b></h1>
diff --git a/09.Greedy Algorithms/Greedy Algorithms.md b/09.Greedy Algorithms/Greedy Algorithms.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Greedy Algorithms - Ochko'z Algoritmlar</b></h1>
diff --git a/10.Dynamic Programming/Dynamic Programming.md b/10.Dynamic Programming/Dynamic Programming.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Dynamic Programming - Dynamic Programming</b></h1>
diff --git a/rekursiya/Cargo.lock → 11.Other Algorithms/Cargo.lock b/rekursiya/Cargo.lock → 11.Other Algorithms/Cargo.lock
diff --git a/rekursiya/Cargo.toml → 11.Other Algorithms/Cargo.toml b/rekursiya/Cargo.toml → 11.Other Algorithms/Cargo.toml
diff --git a/11.Other Algorithms/Other Algorithms.md b/11.Other Algorithms/Other Algorithms.md
@@ -0,0 +1 @@
+<h1 align="center" style="color:orange;"><b>Other Algorithms - Boshqa Algoritmlar</b></h1>
diff --git a/rekursiya/src/main.rs → 11.Other Algorithms/src/recursion.rs b/rekursiya/src/main.rs → 11.Other Algorithms/src/recursion.rs
diff --git a/README.md b/README.md
@@ -1,7 +1,23 @@
-<h2 align="center">Rust Algorithms</h2>
+<h2 align="center">DSA with Rust </h2>
 
 <header>
-<img src="https://github.com/ismoilovdevml/rust-algorithms/blob/master/assets/icon.png" alt="logo" height="60" align="left">
-<h1 style="display: inline">Algoritmlarni Rustda yozamiz</h1>
+<img src="./assets/icon.png" alt="logo" height="60" align="left">
+<h1 style="display: inline">Data Structure va Algoritmlarni Rustda yozamiz</h1>
 
-![alt text](https://github.com/ismoilovdevml/rust-algorithms/blob/master/assets/banner.png)
+![alt text](./assets/banner.png)
+
+## Darsliklar uchun havolalar:
+
+1. [Big O notation](./01.Big%20O%20notation/big-o-notation.md)
+2. [Sonlar](./02.Numbers/Numbers.md)
+3. [Searching Algorithms](./03.Searching%20Algorithms/Searching%20Algorithms.md)
+4. [Sorting Algorithms](./04.Sorting%20Algorithms/Sorting%20Algorithms.md)
+5. [Data Structures](./05.Data%20Structures/Data%20Structures.md)
+6. [Linked List](./06.Linked%20List/Linked%20List.md)
+7. [Tree](./07.Tree/Tree.md)
+8. [Graph](./08.Graph/Graph.md)
+9. [Greedy Algorithms](./09.Greedy%20Algorithms/Greedy%20Algorithms.md)
+10. [Dynamic Programming](./10.Dynamic%20Programming/Dynamic%20Programming.md)
+11. [Other Algorithms](./11.Other%20Algorithms/Other%20Algorithms.md)
+
+> Proyektni contribute qilmoqchi bo'lsangiz, siz uchun doimo pull-request eshiklarimiz ochiq 😉
diff --git a/bubble_sort/README.md b/bubble_sort/README.md
diff --git a/merge_sort/Cargo.lock b/merge_sort/Cargo.lock
diff --git a/merge_sort/Cargo.toml b/merge_sort/Cargo.toml
diff --git a/quick-sort/Cargo.lock b/quick-sort/Cargo.lock
diff --git a/quick-sort/Cargo.toml b/quick-sort/Cargo.toml
diff --git a/search-algorithms/binary-search/Cargo.toml b/search-algorithms/binary-search/Cargo.toml
diff --git a/search-algorithms/linear-search/Cargo.toml b/search-algorithms/linear-search/Cargo.toml
diff --git a/selection-sort/Cargo.lock b/selection-sort/Cargo.lock
diff --git a/selection-sort/Cargo.toml b/selection-sort/Cargo.toml
diff --git a/selection-sort/README.md b/selection-sort/README.md
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1 @@
		<h1 align="center" style="color:orange;"><b>Big O notation - Katta O belgisi</b></h1>
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,2 @@
		<h1 align="center" style="color:orange;"><b>Numbers - Sonlar</b></h1>