Overview int is a signed Integer data type uint is an unsigned Integer data type Size and range of int and uint in go is platform-dependent meaning that the size and range…
Blog
Bubble Sort in Go (Golang)
Introduction In bubble sort: In each iteration i (starting with 0) , we start from first element and repeatedly swap adjacent elements if in wrong order up till length (len-i) where len…
Selection Sort in Go(Golang)
Introduction In selection sort, we maintain two parts Sorted Part Unsorted Part In each iteration, the max or min element (depending upon order is asc or desc) is picked from the unsorted…
Insertion Sort in Go (Golang)
Introduction Insertion Sort is one of the simplest sorting algorithms. In insertion sort, the input array is broken down into two parts Sorted Unsorted Initially sorted part only contains the first element…
Sort a Custom Struct in Go (Golang)
Introduction GO has a sort package that provides utility primitives for the sorting of slices and user-defined types. Any collection can be sorted by the Sort function of sort package of GO…
Binary Search Tree in Go (Golang)
Introduction A binary search tree abbreviated as BST is a binary tree. For each node in a Binary Search Tree Value of each node in the left subtree is less than the…
HeapSort in Golang
Introduction HeapSort is a comparison-based sorting algorithm that uses the Heap Data Structure. Please refer to this link for more information about Heap –https://golangbyexample.com/heap-in-golang/ We demonstrate the heapsort in this article using…
Using Context Package in GO (Golang) – Complete Guide
Introduction: Definition: Context is a package provided by GO. Let’s first understand some problems that existed already, and which context package tries to solve. Problem Statement: Let’s say that you started a…
Comparing floating point numbers in Golang
Introduction Go Lang has two types of floats float32 float64 Comparing Same Float Types Two floating point numbers can be compared using Go’s == operator assuming they are the same float types….
Heap in Golang
Introduction A Heap is a complete binary tree. A complete binary tree is a binary tree in which all levels are full except the last level. Heap is of two types: MinHeap:…