https://github.com/maestropravaler/algoritmos

Estudo Sistematizado de Algoritmos com exemplos práticos e análise do consumo de tempo X memória.
https://github.com/maestropravaler/algoritmos

algorithms big-o challenge elixir examples python

Last synced: 1 day ago
JSON representation

Estudo Sistematizado de Algoritmos com exemplos práticos e análise do consumo de tempo X memória.

• Host: GitHub
• URL: https://github.com/maestropravaler/algoritmos
• Owner: MaestroPravaler
• Created: 2021-01-22T14:18:05.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2021-01-29T00:13:17.000Z (almost 4 years ago)
• Last Synced: 2023-08-27T04:26:16.095Z (about 1 year ago)
• Topics: algorithms, big-o, challenge, elixir, examples, python
• Language: Python
• Homepage:
• Size: 138 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: ReadMe.md

Awesome Lists containing this project

README

        
# ALGORITMOS

Estudos sistematizados sobre algoritmos.

## [BIG 0](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O)

1. [Tempo Constante O(1)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/01_Tempo_Constante.ipynb)

2. [Tempo Linear O(n)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/02_Tempo_Linear.ipynb)

3. [Tempo Logarítmico 0(log n)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/03_Tempo_Logaritmico.ipynb)

4. [Tempo Quadrático O(n^2)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/04_Tempo_Quadrático.ipynb)

5. [Tempo Expoencial O(2^n)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/05_Tempo_Expoencial.ipynb)

6. [Tempo Fatorial O(n!)](https://github.com/Robson-Maestro/Algoritmos/tree/master/BIG_O/06_Tempo_Fatorial.ipynb)

![](./assets/images/bigo.png)

## [HEURÍSTICAS E TÉCNICAS (Desafios)](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS)

Resolvidos e classificados quanto ao BIG_O em python.

1. [Compare_Binary_Trees.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Compare_Binary_Trees.py)

2. [Created_Linked_list.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Created_Linked_list.py)

3. [Decode_Strings.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Decode_Strins.py)

4. [Detect_Circular_Linked_List.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Detect_Circular_Linked_List.py)

5. [Four_Sum.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Four_Sum.py)

6. [Longest_Increasing_Path_In_A_Matrix.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Longest_Increasing_Path_In_A_Matrix.py)

7. [Longest_Substring_Without_Repeating_Characters.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Longest_Substring_Without_Repeating_Characters.py)

8. [Max_Consecutives_Ones.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Max_Consecutives_Ones.py)

9. [Maximum_Path_Sum.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Maximum_Path_Sum.py)

10. [Minimum_Depth_Of_Binary_Tree.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Minimum_Depth_Of_Binary_Tree.py)

11. [Path_Sum_2.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Path_Sum_2.py)

12. [Three_Sum.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Three_Sum.py)

13. [Two_Sum.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Two_Sum.py)

14. [Word_Search.py](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/Word_Search.py)

### Resolução dos desafios utiliando o [ELIXIR](https://github.com/Robson-Maestro/Algoritmos/tree/master/HEURISTICS/desafios_elixir/)

## [Agradecimentos Especiais]

Ao Tiago Brito e seu projeto [AlgoMania](https://algomania.com.br/) por compartilhar seus conhecimentos de forma simples e eficaz e permitir a divulgação deste conteúdo.

![](./assets/images/logoalgo.png)