Important Algorithms

---

Basic Level:

Sorting:

• Bubble Sort (Bolha)
• Selection Sort (Seleção)
• Insertion Sort (Inserção)
• Merge Sort (Merge Sort)
• Quick Sort (Quick Sort)

Searching:

• Linear Search (Busca linear)
• Binary Search (Busca binária)

Recursion:

• Factorial (Fatorial)
• Fibonacci (Fibonacci)

Basic Data Structures:

• Vectors (Vetores)
• Strings (Strings)
• Lists (Listas)
• Dictionaries (Dicionários)

---

Intermediate Level:

Graph Algorithms:

• Breadth First Search (Busca em largura)
• Depth First Search (Busca em profundidade)
• Dijkstra's algorithm (Dijkstra)
• Kruskal's algorithm (Kruskal)

Trees:

• Binary Search Trees (Árvores binárias de busca)
• AVL Trees (Árvores AVL)
• B-Trees (Árvores B)

Dynamic Programming:

• Knapsack problem (Problema da mochila)
• Fibonacci sequence (Sequência de Fibonacci)
• Longest Common Subsequence (Longest Common Subsequence)

---

Advanced Level

Genetic Algorithms:

• Selection (Seleção)
• Crossover (Crossover)
• Mutation (Mutação)

Artificial Neural Networks:

• Perceptron (Perceptron)
• Backpropagation (Backpropagation)
• Convolutional Neural Networks (Redes neurais convolucionais)

Machine Learning:

• Linear regression (Regressão linear)
• K-means clustering (K-means clustering)
• Support Vector Machines (Support Vector Machines)