Blog
• (1-5 of 26 posts)-
Sorting Algorithms in Go
The fundamental sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, and Heap Sort. Out of these, Quick, Merge, and Heap Sort offer the best efficiency. Here's a breakdown of how they work, implemented in Go.
-
Binary Search in Go
Binary Search is an algorithm that is used to find out if a number exists in a list, and if so, what it's position in that list is. The strategy is to "divide and conquer", which makes it much faster and more efficient than checking every single number.
-
Working with The Graph Data Structure in Go
Graphs are data structures made up of a bunch of individual nodes that connect to each other. Their main purpose is to model the connection relationships between things. Another name for graphs that you've likely already heard of is "networks".
-
Binary Trees In Golang
A binary tree is a data structure that consists of a hierarchy of nodes where each node has a maximum of two child nodes that can each also have a max of two child nodes. They offer a way of organizing data that can be fast and efficient to search.
-
Working With Linked Lists In Golang
A linked list is a linear data structure that lets you represent a group of things that are connected in a sequence. The items don't have to live in contiguous memory like arrays so adding and removing in the middle of the list can be more efficient.