In this article, we will explore the concept of Higher-Order Functions in Go and how they can be used to enhance code reusability.

Higher-Order Functions in Go

Some Go resources you should check out if you are learning or new to Go.

Go resources

The intuitive meaning of doing O(1) optimization of O(n) complexity on a theoretical level.

Theoretical runtime analysis of Big O notation

C++ program that calculates the time elapsed for a simple code in milliseconds, microseconds, nanoseconds, and seconds.

Measure elapsed time of C++ program

Project report blog for Cloud native measurement, reporting and validation of carbon emissions which was completed during Linux Foundation Mentorship Fall Term 2021.

Linux Foundation Mentorship 2021

Project report blog for Improve the gRPC and OpenAPI ecosystem which was completed during Google Season of Docs 2021.

Google Season of Docs 2021

Kharagpur Winter of Code is a 5-week long online program for students who are new to open source software development.

Kharagpur Winter of Code 2020

Project report blog for Refactoring the Existing Docs Site of gRPC-Gateway which was completed during Google Season of Docs 2020.

Google Season of Docs 2020

Dynamic programming approach to generate set partitions.

An efficient algorithm for generating set partitions

Algorithm to find the Nth Fibonacci number in logarithmic time.

Finding Nth Fibonacci number in logarithmic time

The Monty Hall problem is a famous, seemingly paradoxical problem in conditional probability and reasoning using Bayes' theorem.

Monty Hall problem

The nature of the conic section is defined by its discriminant.

Blog

All Posts