Home » Golang » Golang Programs

# Golang program to find the smallest number between two numbers using math.Min() function

Here, we are going to learn **how to find the smallest number between two numbers using math.Min() function in Golang (Go Language)?**

Submitted by Nidhi, on February 15, 2021

**Problem Solution:**

In this program, we will find the smallest value between two numbers using *math.Min()* function and print the result on the console screen.

**Program/Source Code:**

The source code to **find the smallest number between two numbers using math.Min() function** is given below. The given program is compiled and executed successfully.

// Golang program to find the smallest number between two numbers // using math.Min() function. package main import "fmt" import "math" func main() { var num1 float64 = 10.25 var num2 float64 = 20.14 var small float64 = 0 small=math.Min(num1, num2) fmt.Printf("Smallest number is : %f", small) }

**Output:**

Smallest number is : 10.250000

In the above program, we declare the package *main*. The *main* package is used to tell the Go language compiler that the package must be compiled and produced the executable file. Here, we imported the *fmt* package that includes the files of package *fmt* then we can use functions related to *fmt* package.

Here, we also included the *math* package to use math-related functions and created the *main()* function. The *main()* function is entry point for the program. Here, we created 3 floating-point variables *num1*, *num2*, *small*, which is initialized with **10.25**, **20.14**, **0** respectively.

Here, we used the *Min()* function of the *math* package to find the smallest number between two numbers and print the smallest number on the console screen.

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions