Algorithms and Data Structures in Python

Mixkit: Known for its user-friendly interface, Mixkit provides a vast collection of free video assets, including motion graphics and video templates. While they aren't directly from Videohive, they offer a comparable quality that can be integrated into your projects seamlessly.
Videezy: Videezy offers a variety of free and paid video assets, including After Effects templates. Their extensive library is perfect for those looking to enhance their videos without breaking the bank.
Motion Elements: While Motion Elements primarily focuses on premium content, they regularly feature free downloads that include video templates similar to those found on Videohive. Their search interface allows you to filter out the free options easily.
Editor’s Depot: This site provides free editing tools and templates, ensuring you have access to some elements similar to Videohive offerings. Though the selection might not be as vast, it’s a valuable resource for cost-effective production.
Motion Array: With a solid reputation, Motion Array occasionally offers free downloads that replicate some Videohive elements. Subscribing to their newsletter might help you get alerts about any new freebies available.

Algorithms and Data Structures in Python - Part II

Fenwick trees, caches, prefix trees and substring-search algorithms implemented in Python

What you'll learn

Have a good grasp of algorithmic thinking
Be able to develop your own algorithms
Be able to detect and correct inefficient code snippets

Requirements

Python basics
Some theoretical background ( big O notation )

Description

This course is for those who are interested in computer science and want to implement the algorithms and given data structures in Python. In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.

Chapter 1: Binary Indexed Trees (Fenwick Trees)

theory behind the binary indexed tree or Fenwick tree data structure

how to use this data structure in computer vision and artificial intelligence

implementation in Python

Chapter 2: LRU Caches

what are caches and why are they so important

theory behind LRU caches

implementation in Python

Chapter 3: Prefix Trees (Tries)

what are tries or prefix trees

real world applications of tries

implementation in Python

Chapter 4: Substring Search Algorithms

what are substring search algorithms and why are they important in real world softwares

brute-force substring search algorithm

Boyer-Moore algortihm

Knuth-Morris-Pratt substring search algorithm

implementation in Python

Thanks for joining my course, let's get started!

Who is the target audience?

This course is suited for anyone who has some basic knowledge in Python

Top Rated News