How to take care naughty functions -> "Recursive"

When we play Recursive Function, we need precautions , because it's recursive in nature. There's a big problem if base condition not valid then it repeat infinite times. Which cause panic in go-lang. Today, I use simple example such as factorial

package main
import (
"fmt"
)
func main() {
i := fact(5)
fmt.Println(i)
}
func fact(n int)int {
if n == 1{
return n
}
return n * fact(n-1) } Play

If you're a detective then you may notice that in func fact return again fact. This line
actually recursive line which repeat over and over, until base condition are true

Comments

Rosicrucian cipher

In 1513 Cornelius Agrippa introduce early form Rosicrucian Cipher in his books Occult of Philosophy. Geometric and simple substitution cipher are well known ciphers Pigpen , Freemason, Napoleon and tic tac toe ciphers in which alphabets or symbols arrange in grids. This is an anagram, "How to reconstruct a data " lets encode the message. Pigpen cipher , Rosicrucian and Tic tac toe Cipher Thank you have a good day.

Without this Agent , mission doesn't accomplish?

If you play military games such as Delta force , IGI Project , commandos etc . You familiar about in your team. Each member of team are unique in their skills. Some are snipers , short gun , hackers, communication officer. Now I will introduce golang special agent which are quite helpful in most of time. Variadic Function will show in a moment! Variadic Function: Variadic Functions means a function that arguments varing. In variadic function ... called ellipsis. package main import ( "fmt" ) func main() { values := []int{1,2,3} fmt.Println("Value[0]",seriesAdd(values[0])) fmt.Println("Total", seriesAdd(values...)) } func seriesAdd(x ...int)int{ var count int = 0 for _, v := range x{ count+= v } return count } Conditions : Before passing to the variadic function array must be slice. ...

Solve Juggle Pieces

Hello guys, Today is quite interesting topic "Juggle the pieces", this is elaborate after affine ciphers. Affine Ciphers are monoalphabetic ciphers, because every alphabet map against a number. Affine cipher introduce modulus operator. There are so many ciphers build on affine ciphers. Previous cipher Oh yeah, very well Atbash cipher also a good example of this category. Mathematical Statement: E(X) = D(E(X))-----------------------------------------------------(0) here E is a function that take parameter x and return encrypted text. Similar with D function but this is inverse function of E. E(x) = (ax+b) mod m--------------------------------------------(1) a, b are keys and m is size of alphabetic, while modules (mod) is an operator which help to...

Search This Blog

Do you support us?