## Microservice Architecture

When building a microservice architecture, your individual services need to communicate with one another. One widely accepted de facto standard for microservice communication is RESTful web services

## Sorting: Bubble

The bubble sort algorithm is a sorting algorithm that compares a pair of neighboring elements and swaps them if they are in the wrong order.  https://play.golang.org/p/1ob1N-sZKmp Note: No nested loop used help in reducing the unnecessary looping of all element even a single pair of the unsorted list.

## Slice, for, len(), cap(), append, copy

Shortcoming of Go array is address by Go slice. It can be appended to elements after the capacity has reached its size. Slices are dynamic and can double the current capacity in order to add more elements. https://play.golang.org/p/_8fqAbg2cUJ Slice and Functions ( call by reference) https://play.golang.org/p/Sc2yD7rXpRl

## Array, for, for..range, len(), function(call by value)

an ordered sequence of elements of the same type and access to an element by index begins with zero for the first element. https://play.golang.org/p/-DRHLqWWB66 Go arrays are not dynamic but have a fixed size. To add more elements than the size, a bigger array needs to be created and all Read more…

## Memoization Technique (Fibonacci)

Let’s utilize a memoization technique to speed up our Fibonacci calculation. Memoization is an optimization technique used to increase performance by storing the results of expensive function calls and returning the cached result when the same input occurs again.

## Recursive Function

Fibonacci sequence – a simple recursion and two performance improvements The Fibonacci sequence is a sequence of numbers where each number is equal to the previous two numbers added together. Here’s an example of this: So, 1 plus 1 is 2, 2 plus 3 is 5, 5 plus 8 is 13, and Read more…