UDEMY 2021 - Algorithms and Data Structures in Python
- 1. UDEMY 2021 - Selenium Webdriver with Java (Basics + Advance + Architect)
- 2. UDEMY 2021 - Docker Mastery: with Kubernetes +Swarm from a Docker Captain
- 3. UDEMY 2021 - All You Need to Know About REST Integration In ServiceNow
- 4. UDEMY 2021 - PLC Programming From Scratch (PLC I)
A guide to implement the most up to date algorithms from scratch: arrays, linked lists, graph algorithms and sorting
What Will I Learn?
Be able to develop your own algorithms
Be able to detect and correct inefficient code snippets
In the first part of the course we are going to learn about basic data structures such as linked lists, stacks, queues, binary search trees, heaps and some advanced ones such as AVL trees and red-black trees.. The second part will be about graph algorithms such as spanning trees, shortest path algorithms and graph traversing. We will try to optimize each data structure as much as possible.
In each chapter I am going to talk about the theoretical background of each algorithm or data structure, then we are going to write the code step by step in Python.
Most of the advanced algorithms relies heavily on these topics so it is definitely worth understanding the basics. These principles can be used in several fields: in investment banking, artificial intelligence or electronic trading algorithms on the stock market. Research institutes use Python as a programming language in the main: there are a lot of library available for the public from machine learning to complex networks.
Who is the target audience?
Created by Holczer BalazsLast updated 2/2018EnglishEnglish [Auto-generated]
Size: 1.65 GB