Published inNerd For Tech·3 days agoFloyd’s Cycle Finding AlgorithmFloyd’s cycle-finding algorithm is famous for detecting if a linked list contains a cycle. This algorithm is also referred to as the Hare-Tortoise algorithm because of the use of a slow and fast pointer. How it Works The algorithm starts with two pointers set to the head of a linked…Computer Science4 min readComputer Science4 min read
Aug 2, 2022Update: Multiplayer PrototypeI have been learning to create multiplayer games. I have been using the Unity engine to create the game and Mirror to handle multiplayer aspects.Learning To Code1 min readLearning To Code1 min read
Jul 25, 2022Creating a Multiplayer Prototype in UnityI have been working on learning how to implement multiplayer for unity projects using Mirror. To use Mirror, you can click the link above and add it to your unity assets. Now go into your unity project and import Mirror using the package manager.Made With Unity2 min readMade With Unity2 min read
Published inNerd For Tech·Jul 21, 2022Input and Output in C++To input and output information to the console in C++, you will use the standard input-output stream (iostream) library. Output To output information, you will use the code std::cout. This code is referencing the standard output stream. In most cases, the output device is the display screen. Here is an…Learn To Code1 min readLearn To Code1 min read
Published inNerd For Tech·Jul 17, 2022Tree TraversalThere are many ways to traverse a binary tree. The two most common ways to traverse a binary tree are depth-first search and breadth-first search. Depth-First Search Depth-first search works by starting at the root node and traversing as far as possible along the branches of the tree. Once the…Learn To Code4 min readLearn To Code4 min read
Published inNerd For Tech·Jul 16, 2022Binary HeapsA binary heap is a type of binary tree that has its own set of rules. There are two types of binary heaps which are the max-heap and the min-heap. Rules The first rule the binary max-heap follows is that each node’s value must be greater than the value of…Learn To Code4 min readLearn To Code4 min read
Published inNerd For Tech·Jul 14, 2022Binary Search TreeA binary search tree is a node-based data structure that stores data according to a set of rules. The left subtree of any node will have a value less than the parent node's value. The right subtree of any node will have a value greater than the parent node’s value…Learn To Code4 min readLearn To Code4 min read
Published inNerd For Tech·Jun 28, 2022Selection SortSelection sort is a sorting algorithm that passes through the unsorted part of an array to find the lowest or smallest element and puts it at the beginning. The selection sort algorithm has two subarrays. One is the sorted subarray or the part that is known to be in order…Computer Science3 min readComputer Science3 min read
Published inNerd For Tech·Jun 26, 2022Bubble SortBubble sort is a sorting algorithm that repeatedly goes through an array and swaps adjacent elements if they are not in order. The algorithm is repeated until the list is sorted. Example Sort the given array {3, 2, 5, 1, 4}.Computer Science5 min readComputer Science5 min read
Published inNerd For Tech·Jun 25, 2022Binary SearchA binary search is an algorithm that finds a given target in a sorted array. The binary search algorithm compares the target to the middle element of the array. Assuming the target is not the middle element you will compare whether the target is larger or smaller than the middle…Computer Science4 min readComputer Science4 min read
