###### Data Structure and Algorithm

## FizzBuzz

For numbers which are divisible of both 3 and 5, print “FizzBuzz” instead of the number. Divisible by 3 print “Fizz” and divisible by 5 print “Buzz”

For numbers which are divisible of both 3 and 5, print “FizzBuzz” instead of the number. Divisible by 3 print “Fizz” and divisible by 5 print “Buzz”

The time complexity of this algorithm is in the order of O(log n). The binary search algorithm compares the input value to the middle element of the sorted collection. func Search(n int, f func(int) bool) int Search uses binary search to find and return the smallest index i in [0, Read more…

The time complexity of the linear search algorithm is O(n). This means that the running time increases at most linearly with the size of the input.

Building Go Applications for Different Operating Systems and Architectures On One Computer. To run a build for a different platform, we simply set the GOOS and GOARCH environment variables (for the operating system and architecture, respectively) and invoke “go build” When you run a command like go build, Go uses the current platform’s GOOS and GOARCH to determine how to build Read more…