Learn the coding skills for your next job

How to Use Golang’s Generics


Generics in Go are just around the corner! This is one of the most eagerly-awaited features since the release of the language. Many devs have gone so far as to say Go’s previous lack of generic types made the language … Read more

Node.js vs Golang: Compared Over 6 Key Areas

golang vs nodejs

In 2009, the computer science world was blessed with two powerful tools: Golang and Node.js. Golang is a procedural, multiparadigm, open-source programming language, created by Google developers that were unhappy with the existing languages. C, C++, and Java all failed … Read more

Go vs C#: Compared Over 5 Key Areas

go vs c sharp

Golang and C# offer a unique mixture of similarities and differences, having both been inspired by the same language but operating in vastly different ways. Golang is a procedural, open-source, compiled programming language developed by Google developers in 2009, after … Read more

Golang vs Java: 6 Key Comparisons

golang vs java go

Golang (or Go) and Java offer an interesting comparison because despite their wide differences, there are also key similarities in how and where they’re used by programmers. But which one is best for you? We’ll start by breaking down the … Read more

What is Go Good For? (And What Is Golang Used For?)

what is go good for and used for golang

In 2007, frustrated by some of C++’s inefficiencies and overcomplicated nature, and desiring a programming language designed specifically for multi-core processors and effectively managing large projects, three Google engineers, Robert Griesemer, Rob Pike, and Ken Thompson, designed the Go language. … Read more

Quick Sort in Golang


Quicksort is an efficient sorting algorithm commonly used in production sorting implementations. Like Merge Sort, Quicksort is a divide-and-conquer algorithm. As the name implies, Quicksort is one of the fastest sorting algorithms, but you have to pay attention to detail … Read more

How to Write Insertion Sort in Go


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 like you would … Read more