This video teaches the following:
C++ Structures https://www.youtube.com/watch?v=RUD78aW7jaU Nested Structures https://www.youtube.com/watch?v=Zl9yBeTb9ZY Arrays of Structures https://www.youtube.com/watch?v=MHSyatOu3uE Structures & Functions https://www.youtube.com/watch?v=Jc9DhHCg_Tk Pointers to Structures & DMA https://www.youtube.com/watch?v=j7ZxCShVc8I
Why Pointers? https://www.youtube.com/watch?v=qK2YHYIfkE4 The Basics of Pointers https://www.youtube.com/watch?v=GIIFVy4VTFw Arrays and Pointers https://www.youtube.com/watch?v=MuB2VHIuaCU Dynamic Memory Allocation https://www.youtube.com/watch?v=rB8myY8NfjU Functions & Pointers https://www.youtube.com/watch?v=NTz9ETEIVGY
Problem Description Place elements organized in an array or list in either ascending or descending order. Algorithm Description Bubble sort is a simple sorting algorithm that repeatedly steps through the list or array to be sorted, compares each pair of adjacent items, and swaps them if they are in the […]
Problem Description Place elements organized in an array or list in either ascending or descending order. Algorithm Description Selection sort is a sort algorithm that repeatedly searches remaining items to select the lest one and move it to its final location Videos Going through Selection Sort with Actual Input C++ […]
Problem Description The Horspool’s algorithm is an algorithm for finding a substring (called a pattern) inside of a string (called a text). The pattern length is m and the text length is n. Horspools is a simplification of the Boyer-Moore string search algorithm and requires taking up more space (memory) […]
Problem Description Prim’s algorithm uses the greedy approach to connect n points in the cheapest possible way to make a path. The greedy approach suggests a “greedy” grab of the best alternative available in the hope that a sequence of optimal choices will yield an optimal solution to the whole […]
Problem Description Given n items of known weights (w1,….,wn) and values (v1,…,vn) and a knapsack of capacity W, find the most valuable subset of the items that fit into the knapsack. The 0-1 Knapsack Problem can be solved using the brute-force exhaustive search technique where you must find all 2n […]
Give change for amount (n) using the minimum number of coins of denominations (d1 < d2 < … < dm). There is also a greedy algorithm to solve this problem but this post is on the dynamic programming technique algorithm. In this problem, we assume that there is an unlimited […]