STEP ONE: Pause Your Antivirus Software If you have any antivirus software (Norton, TotalAV, Guardio, Avast, AVG, Aura, Bitdefender, Surfshark, Avira, etc.) on your computer, pause it so that you can fully download the zip file in the next step. If you do not know how to pause your antivirus, […]
When you can write your code in the form or without having to put ways to exit the loop (break, continue, or goto) in the body of the loop then a person reading your code can immediately understand what condition is going to terminate your loop just by looking at […]
(Image taken from https://xkcd.com/) The goto statement in C++ (and many other languages) is generally considered bad programming practice. Here are some reasons why: Take a look at this Stack Overflow post that shows a student’s program that used goto: https://cplusplus.com/forum/beginner/210844/
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 […]