Anthony LeporeinBetter Humans30 Years of Keeping a Dream JournalRecording my dreams every morning since high school has fostered an appreciation of the variety of life’s experiences.Mar 16, 20221Mar 16, 20221
Anthony LeporeinCodeXDetect a Loop/Cycle in a Singly Linked ListA detailed examination of the Floyd cycle detection algorithm in RubyNov 4, 2021Nov 4, 2021
Anthony LeporeinCodeXLexicographic Permutation Algorithm in RubyA simple algorithm coded in Ruby to find the next lexicographic permutation explained in detail.Oct 28, 20211Oct 28, 20211
Anthony LeporeHow Did an Unknown Ghostwriter Become Part of an Identity Theft Crime?A warning to freelancersOct 6, 20211Oct 6, 20211
Anthony LeporeinCodeXThe Fastest Searching Algorithm: Binary Search in RubyI am going to start off by saying that this is the fastest searching algorithm with a few caveats. For starters, the data structure that is…Jun 20, 20211Jun 20, 20211
Anthony LeporeinCodeXData Structures & Algorithms in Ruby: Depth-First Search (In-order) for Binary TreesWe have now come of the final of the three main types of Depth-First Search (DFS) for a Binary Search Tree: In-Order traversal. DFS…Jun 11, 2021Jun 11, 2021
Anthony LeporeinCodeXData Structures & Algorithms in Ruby: Depth-First Search (Post-order) for Binary TreesLast week we introduced the concept of Depth-First Search for Binary Tree traversals. Of the three main types of Depth-First Search (DFS)…Jun 5, 2021Jun 5, 2021
Anthony LeporeinCodeXData Structures & Algorithms in Ruby: Depth-First Search (Pre-order) for Binary TreesIn continuing with our current topic of binary tree traversals in Ruby, we are going to introduce depth-first search this week. If you…May 28, 2021May 28, 2021
Anthony LeporeinCodeXData Structures & Algorithms in Ruby: Breadth-First Search for Binary TreesLast week, we implemented a #find method for our Binary Search Tree which returned the Boolean true/false indicating whether our value was…May 22, 2021May 22, 2021