#Golang-Basic
29 articles
Getting to Know Hashes Cryptography in Golang
Hashes & Cryptography
The hash
function takes a set of data and reduces it to a smaller fixed size. Hash is often used in programming for everything from searching data to easily detecting changes. The hash
functions in Go are divided into two categories namely cryptographic
and non-cryptographic
. Non-cryptographic
hash
functions can be found under the hash
package and include adler32
, crc32
, crc64
and fnv
.
Get to know Container List and Sort in Golang
In addition to arrays
and maps
, Go has several more collections available under the container package. We’ll look at the container/list
package as an example.
Get to know the Standard String Library in Golang
As programmers who are learning Go Lang, we also need to know Go’s default library packages so that we understand better and have an easier time interacting with the core packages. There are lots of built-in libraries from Golang that can make it easier for us when coding. For example, if we need string conversion, the Go library is provided by default.
Get to know the Input Output Library in Golang
Before studying the Golang IO library, there are lots of functions in the IO library but the most important ones are 2 function interfaces, namely Reader
and Writer
. Reader
is usually used to read data from a file or some provided input/output. Meanwhile Writer
is a function that will later write data to a file or input/output provided by our system.
Get to know functions, multiple returns, variadic and closures in Golang
Second Function
Consists of input
, output
.
Until now, we can only use the Go program for play functions like this.
Get to know variables and constants in Golang
Variables
The following is an example of the basic implementation of using variables in the program below
How to implement Binary Search and Tree Golang
Basic Definition
Data structure Binary Search and Tree is a pattern used for tree -based search. Before you further know Binary Search Tree commonly called BST, you need to first understand the concept of tree. Tree (tree) is a form of data structure that illustrates the hierarchical relationship between its elements (such as one to many relations). A node in a tree can usually have several more nodes as branching over him.
How to implement queue (queue) in Go Language
Basic Definition
Queue or often we know is a queue data structure where the data we enter will be delivered, in other words the first data will come out first. Usually we often know that Istra FIFO (First in First Out).
How to Determine Consonant Vowels in Golang
Introduction
Determining consonant vowels here will be divided into several examples. Later we will know better which processes will be carried out sequentially. What we already know is that the vowel characters are a
,i
,u
,e
,o
and this will be a condition in the program later.
How to Implement Stack in Golang
What is a stack?
Stack is one that is commonly used in programming or computer storage systems. For ‘programmers’ or those usually involved in the IT world, you must be familiar with this term. Stacks are used to make it easier to organize data. So what exactly is Stack? What are the advantages and disadvantages of using it? OK, Santekno will explain to you in more detail and Santekno will provide a very easy sample
for implementing the stack.
How to implement a single double linked list in Golang
Basic Definition
If you’ve read and read about the Linked List, you can first read Santekno’s post Single Linked List and Double Linked List
Getting to Know Pointers in Golang
We know that sending a variable to a function can be a parameter or a pointer. This pointer is usually a data allocation with a certain address. An example can be seen in the program below.