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. …

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. …

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 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.

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…

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…

This is part of a series of blog posts where I discuss JavaScript Sorting algorithms. I initially started this journey discussing Bubble Sort, and found myself wanting to discuss the entire array of sorting algorithms. In this blog post we will be discussing one of the first sorting algorithms I started learning, Merge Sort. I’ve heard some people say that this is considered an intermediate sorting algorithm, and I agree because of the steps taken to implement this algorithm. I hope this can be a good reference and refresher for those familiar with Merge sort. …

Insertion sort is one of many sorting algorithms. If you are new to sorting algorithms, I recommend you hop over to my first blog on sorting algorithms: “Sorting Algorithms: Bubble Sort”, where I go over some of the fundamental concepts of sorting algorithms, like swap.

What is Insertion Sort and How does it work? In insertion sort, we start to sort our array by selecting and taking out one element. If there is a previous element in the array, we compare the two values. Based on the logic of our algorithm, we either have the two values switch places, or…

This week I’ve chosen to continue discussing the topic of Sorting Algorithms, specifically the Selection Sort Algorithm. If you would like a more in depth breakdown into the fundamentals of sorting algorithms, check out my previous blog, Sorting Algorithms: Bubble Sort — where I go further into some of the more fundamental concepts of Sorting Algorithms like swap.

What is Selection Sort? Selection Sort is similar to bubble sort, but instead of the larger elements moving to the end of the array, the smaller values are selected and positioned to the front of the array one at a time. In…

What is bubble sort?

Bubble sort is a sorting algorithm; it sorts data by comparing two elements and swapping them based on values. I’ve come to see it as a starting point for understanding all other sorting algorithms. It’s something you are likely to run into in technical interviews and it makes for a great foundation before learning about other sorting algorithms. This blog post will go over what bubble sort is and how it works. I hope to make more posts in the future on other sorting algorithms.

Why is it called Bubble Sort? The idea behind bubble sort…

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