Tadda
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Radix Sort
- Linear Search
- Binary Search
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Binary Search Tree (BST)
- AVL Tree
- Red-Black Tree
- Segment Tree
- Dijkstra’s Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Prim’s Algorithm
- Kruskal’s Algorithm
- Union-Find Algorithm
- Topological Sort
- Linear Regression
- Logistic Regression
- Decision Trees
- Support Vector Machines (SVM)
- k-Nearest Neighbors (k-NN)
- Naive Bayes
- k-Means Clustering
- Hierarchical Clustering
- Principal Component Analysis (PCA)
- Independent Component Analysis (ICA)
- Q-Learning
- Deep Q-Networks (DQN)
- A* Search
- Minimax Algorithm
- Alpha-Beta Pruning
- Convolutional Neural Networks (CNN)
- Recurrent Neural Networks (RNN)
- Long Short-Term Memory (LSTM)
- Generative Adversarial Networks (GAN)
- Gradient Descent
- Simulated Annealing
- Genetic Algorithms
- Particle Swarm Optimization
- RSA Algorithm
- AES (Advanced Encryption Standard)
- DES (Data Encryption Standard)
- Diffie-Hellman Key Exchange
- Fast Fourier Transform (FFT)
- Discrete Cosine Transform (DCT)
- Kalman Filter
- TF-IDF (Term Frequency-Inverse Document Frequency)
- Word2Vec
- BERT (Bidirectional Encoder Representations from Transformers)
- LDA (Latent Dirichlet Allocation)