ALGORITHMS AND DATA STRUCTURE

Course programinorder - Binary search trees: definition, operations (insert, delete, search) - Python implementation of trees using dictionaries - Binary heaps: max-heap, min-heap, insert / remove elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms. inserting / removing elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms. inserting / removing elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms.