Photo by Elina Sitnikova on Unsplash

This week’s sorting algorithm is going to be a little different compared to the other sorting algorithms. With Radix Sort, we are not comparing two values based on: “is one greater than the other?”, instead we are sorting the data by: binary numbers and not by comparing elements.

Radix sort works on lists of numbers, or binary data, NOT by comparing elements. The more digits the bigger a number. And the way we sort with radix, is by sorting the numbers through 10 distinct buckets. …


Insert

In my previous post we went over the get and set method for the singly linked list in javascript. A Singly Linked List as I mentioned in part one of this series on Linked Lists, is a data structure similar to an array. In this post we will be going over the Insert method which is similar to the set method. Similar to set we are selecting a specific node, but instead of updating the selected node, we are inserting a new node in its position and setting the selected node as the next target for the selected node.

How does the insert method

The…


Get and Set

Hello world, in this blog post I will continue breaking down the Singly Linked List Data Structure, specifically the get and set methods. If you don’t know what a Linked List is or what I mean when I say that we are going to be looking at new methods for a linked list, feel free to go back and read some of my previous blogs.
Part One: Singly Linked Lists and the Push Method
Part Two: Singly Linked Lists and the Pop Method
Part Three: Singly Linked Lists and the Shift and Unshift Method

What is Get?

Get is a method that returns…


Shifting and Unshifting

In this blog post I will continue breaking down the Singly Linked List Data Structure, specifically the shift and unshift methods. The shift method will allow us to remove the node at the beginning of the list, replacing the Head with the second item in our linked list, if there is one. The unshift method will allow us to do the opposite, by adding an item to the list and replacing the current head as the new head of the list. It’s also the exact opposite of pop, where instead of adding to the end of the list, we are…


This week I participated in the Nurture Difference Hackathon, hosted by Cody Green. This was created as a chance for bootcamp grads and alumni to collaborate and create a portfolio level project. This was my first hackathon and I was excited to work on collaborating as it’s been a while since I last paired up to program. …


Popping

In this blog post, we will continue discussing Singly Linked Lists, specifically the pop method. Note: for anyone brand new to the topic, or have no idea what a Singly Linked List is, check out my previous blog where I briefly go in depth on some basic fundamentals and how to start using Singly Linked Lists. By the end of this post, my hope is that you walk away with confidence on how to implement some of the other fundamental methods for using this Data Structure. …


Photo by Park Troopers on Unsplash

In this blog post we will begin to create a singly linked list. By the end, you should have a basic understanding of what a linked list is, how it is similar and different from an array, and how to begin to add elements to the end of a linked list. In later blogs I will further explore methods for linked lists, like other insertions, removals, and traversal methods. But this will be a general overview and a foundational starting point for linked lists.

A Linked List is like an Array

A linked list is a data structure that stores data, similar to an array in that…


In previous blog posts, I’ve gone over different Data Structures as a way to deepen my understanding of these concepts for myself. At the time and currently I still consider myself a novice when it comes to understanding data structures fully, I know many by name and few by experience. In this blog post I will be exploring classes in Javascript. JS isn’t formally an Object Oriented Language, but it is one of my favorite languages so I will be continuing my learning and delving into Data Structures within the context of this language. I’ve had to step away and…


This is part of an ongoing series of blog posts where I cover sorting algorithms. This week I’m looking at Quick Sort.

Photo by Kelly Sikkema on Unsplash

It works on the same assertion that merge sort does because it is solved through recursion where we keep splitting the array until we have arrays that are the length of 1 or 0, which means that they are individually sorted. Introducing the pivot — and here is how it is different from merge sort — it works by selecting one element(the pivot) and finding the index where the pivot should end up in the sorted array. For…


Photo by Markus Winkler on Unsplash

What is a regular expression?

A regular expression is a line of code that you would commonly use as a way to search text for a specific character or group of characters matching the sequence, or meeting the parameters of the search. Simply, a regular expression is a pattern or sequence of code used when we want to search for matching items inside of text. For instance when we hit the ‘command + F’ or ‘Ctrl + F’ shortcut, it should open up a mini search bar in your web browser. Whatever keys we type into the search bar helps us search for and distinguish…

Stephen Galvan

A Software Engineer with a background in Education Technology and Dance. Recent grad form FlatIron Bootcamp, and passion for the arts and working with databases

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store