Recursion, Algorithms and Data Structures Bootcamp in C++ [Udemy Coupon Code]

"When you purchase something through one of the links on our site, we may earn an affiliate commission at no additional cost to you."

Limited offer hurry up

Recursion, Algorithms and Data Structures Bootcamp in C++ is a top-rated Udemy course taught by Holczer Balazs — with over 10430+ students enrolled since it launched.

Recursion, Backtracking, Dynamic Programming, Graphs, Data Structures, Sorting and Substring Search Algorithms

Don’t wait! This special offer won’t last long.

Click the button below to Get up to 100% OFF the regular price.

(The discount will be applied automatically at checkout — no code needed!)

Hurry — this discount on Recursion, Algorithms and Data Structures Bootcamp in C++ won’t be around forever. Take action now!

100% off Udemy coupon code

Why enroll in the Recursion, Algorithms and Data Structures Bootcamp in C++ Udemy Course?

  • Udemy gives you access to over 250,000 courses and 85,000 expert instructors worldwide.
  • Courses are led by experienced professionals dedicated to delivering a high-quality learning experience.
  • Many of Udemy’s most popular courses have hundreds of thousands of students enrolled.
  • Udemy offers online coupons, promo codes and voucher for the majority of its courses.

Recursion, Algorithms and Data Structures Bootcamp in C++ Udemy Promotion code

Course Sections
Introduction
### RECURSION ###
### SEARCH ALGORITHMS ###
### BACKTRACKING ###
### DYNAMIC PROGRAMMING ###
### DATA STRUCTURES ###
Data Structures – Arrays
Data Structures – Linked Lists
Data Structures – Stacks
Data Structures – Queues
Data Structures – Trees
Priority Queues (Heaps)
B-Trees
Associative Arrays (HashTables)
### GRAPH ALGORITHMS ###
Graph Algorithms – Breadth-First Search (BFS)
Graph Algorithms – Depth-First Search (DFS)
Graph Algorithms – Dijkstra’s Shortest Path Algorithm
Graph Algorithms – Bellman-Ford Algorithm
### SUBSTRING SEARCH ALGORITHMS ###
### SORTING ALGORITHMS ###
Algorhyme FREE Algorithms Visualizer App
DOWNLOADS (Course Materials)
Course Description
Requirements
C++ fundamentals

This course is for those who are interested in computer science and want to implement the algorithms and given data structures in C++ from scratch. 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: Recursion

theory behind recursion (recursive function calls)

stack memory and heap memory

recursion and stack memory of the OS

recursive problems such as the Towers of Hanoi problem
Chapter 2: Backtracking

what is backtracking

how to solve problems with backtracking

N-queens problem

coloring problem

knight’s tour
Chapter 3: Dynamic Programming

overlapping subproblems and dynamic programming

what is “memoization” and “tabulation”?

Fibonacci numbers

knapsack problem
Chapter 4: Data Structures

data structures and abstract data types (ADTs)

arrays

linked lists

stacks

queues

binary search trees

priority queues (heaps)

associative arrays (hash tables)
Chapter 5: Graphs

directed and undirected graphs

graph traversal: breadth-first search and depth-first search

shortest path algorithms

Dijkstra’s algorithm

Bellman-Ford algorithm
Chapter 6: Substring Search Algorithms

the most relevant substring search algorithms

naive substring search

Knuth-Morris-Pratt (KMP) substring search algorithm

Rabin-Karp algorithm

Z algorithm (linear pattern matching)
Chapter 7: Sorting

stable sorting and adaptive sorting

comparison based and non-comparison based sorting algorithms

string sorting

bubble sort

selection sort and insertion sort

quicksort

merge sort

counting sort and radix sort
These are the topics we are going to consider on a one by one basis. After every topic there is a Q&A section where you can test your knowledge on the given topics. Thanks for joining my course, let’s get started!