algorithms

README

Example of creating a Go module with different sorting algorithms

• Generating an array with random values
• Binary Sort
• Select Sort
• Recursive
• Quick Sort
• MinMax

---

Documentation

Overview

Package algorithms package demonstrates some basic algorithms Binary Sort , Select Sort , Recursive , Quick Sort , Hash table

Index

• func BinarySearch(arr []int, item int) int
• func Fact(x int) int
• func MakeArray(size int) []int
• func MinMax(array []float64) (min float64, max float64)
• func QuickSort(arr []int) []int
• func RandomFillArray(arr []int, rangeRandom int) []int
• func Recursive(i int) int
• func SelectorSort(arr []int) []int

Functions

func BinarySearch

func BinarySearch(arr []int, item int) int

BinarySearch sorting array, arr is input array, item search value , return arr.

func Fact

func Fact(x int) int

Fact calc

func MakeArray

func MakeArray(size int) []int

MakeArray creating an empty array, size , return x.

func MinMax

func MinMax(array []float64) (min float64, max float64)

MinMax is finds the minimum and maximum elements in the array.

func QuickSort

func QuickSort(arr []int) []int

QuickSort is fast sorting.

func RandomFillArray

func RandomFillArray(arr []int, rangeRandom int) []int

RandomFillArray filling an array with random numbers

func Recursive

func Recursive(i int) int

Recursive search

func SelectorSort

func SelectorSort(arr []int) []int

SelectorSort sorting array, arr is input array. return arr