Over on the Qvault community Discord server, we’re starting a new initiative; we’re doing free live events focused on getting you your first dev job! For background, I’ve been running Qvault.io for over a year now, and while people are loving the courses, we’ve started offering more personalized help surrounding…

Insertion sort builds a final sorted list one item at a time. It’s much less efficient on large lists than more advanced algorithms like quicksort — The post How to Write Insertion Sort in Go first appeared on Qvault. Insertion sort builds a final sorted list one item at a time. It’s much less efficient on large lists than more advanced algorithms like quicksort or merge sort. Insertion sort is a simple algorithm that works just…

Quicksort is an efficient sorting algorithm that’s widely used in production sorting implementations — The post Quick Sort in Golang first appeared on Qvault. Quicksort is an efficient sorting algorithm that’s widely used in production sorting implementations. Like merge sort, quick sort is a divide and conquer algorithm. …

A red-black tree is a kind of self-balancing binary search tree — The post Building a Red-Black Binary Tree in Python first appeared on Qvault. A red-black tree is a kind of self-balancing binary search tree. Each node stores an extra bit, which we will call the color, red or black. The color ensures that the tree remains approximately balanced during insertions…

In cryptography, the one-time pad, or OTP is a way of encrypting information so securely that it’s impossible to be cracked — The post Intro to the One-Time Pad Cipher first appeared on Qvault. In cryptography, the one-time pad, or OTP is a way of encrypting information so securely that it’s impossible to be cracked. …

Robin William’s character explains that it’s bad practice to use terms like “very tired” or “very sad” — The post Beautiful Language and Beautiful Code first appeared on Qvault. “Dead Poet’s Society” is a classic film, and has become a recent favorite of mine. There’s a scene in particular that I enjoy, where Robin William’s character explains that it’s bad practice to use terms like “very tired” or…

A universally unique identifier (UUID) is a 128-bit format for creating IDs in code that has become popular in recent years, especially in relation to database keys — The post What are UUIDs, and should you use them? first appeared on Qvault. A universally unique identifier (UUID) is a 128-bit format for creating IDs in code that has become popular in recent years, especially in relation to database keys. By using UUIDs, you ensure that your ID is…

Merge sort is a recursive sorting algorithm and, luckily for us, it’s quite a bit faster than bubble sort. — The post Merge Sort in Golang with Examples first appeared on Qvault. Merge sort is a recursive sorting algorithm and, luckily for us, it’s quite a bit faster than bubble sort. Merge sort is a divide and conquer algorithm. Divide Divide the input slice into two (equal) halves Recursively sort the…

Bubble sort is named for the way elements “bubble up” to the top of the list. — The post Writing Bubble Sort in Go from Scratch first appeared on Qvault. Bubble sort is named for the way elements “bubble up” to the top of the list. Bubble sort repeatedly steps through a slice and compares adjacent elements, swapping them if they are out of order. …