Anthony LeporeNaive String Search with and without Two Loops in Ruby and JavaScriptSince graduating from a software engineering coding bootcamp I have been spending most of my time getting a handle on the basics of…Mar 12, 2021Mar 12, 2021
Anthony LeporeRadix Sort with a mix of positive and negative integers without added time complexity.One of the beautiful things about Radix Sort is that of the basic sorting algorithms it sits on the low end of Big O. Generally speaking…Mar 21, 2021Mar 21, 2021
InCodeXbyAnthony LeporeData Structures in Ruby: Singly Linked ListAlthough computer science majors will probably learn data structures and algorithms in a language like C, C++, Java, or Python, I first…Mar 26, 20211Mar 26, 20211
InCodeXbyAnthony LeporeData Structures in Ruby: Singly Linked List — Part 2In the previous post, we set up our Node Class as well as our SinglyLinkedList Class, including the initialization and a few basic methods…Mar 31, 2021Mar 31, 2021
InCodeXbyAnthony LeporeData Structures in Ruby: Doubly Linked ListLast week we looked at Singly Linked Lists in Ruby with examples of how to set up the class structures as well as exploring some common…Apr 9, 20211Apr 9, 20211
InCodeXbyAnthony LeporeData Structures in Ruby: StackA stack is a simple data structure that follows the principal, “Last In, First Out.” Unlike many terms used in computer science, this one…Apr 16, 2021Apr 16, 2021
InCodeXbyAnthony LeporeData Structures in Ruby: QueueComing from a theater background, my concept of queue revolved around what lighting pattern was executed or what sound design file was to…Apr 25, 2021Apr 25, 2021
InCodeXbyAnthony LeporeData 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
InCodeXbyAnthony LeporeData 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
InCodeXbyAnthony LeporeData 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
InCodeXbyAnthony LeporeData 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
InCodeXbyAnthony LeporeThe 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