algOne is one way to solve the problem.

algThree is a third way to solve the problem. Provided by Bill Hathaway https://twitter.com/billhathaway

algTwo is a second way to solve the problem. This approach takes an io.Reader to represent an infinite stream. This allows for the algorithm to accept

algTwo is a second way to solve the problem. Provided by Tyler Stillwater https://twitter.com/TylerStillwater

assembleInputStream combines all the input into a single stream for processing.

average calculates the batting average for a player.

checkShutdown checks the shutdown flag to determine if we have been asked to interrupt processing.

copyBuffer is the actual implementation of Copy and CopyBuffer. if buf is nil, one is allocated.

crunch is used to perform branch instructions.

decodeInt accepts a value of any type and will decode that value to an integer.

diceRoll simulate a dice roll.

display can accept and display multiple values of user types.

display declares u as user pointer variable whose value is always an address and points to values of type user.

displayName provides a pretty print view of the name.

doubleLinearSearchIterative takes a sorted/random list of numbers and uses the `iterative` process to check index by index to find the target in both

doubleLinearSearchRecursive takes a sorted/random list of numbers and uses the `recursive` process to check index by index to find the target in both

fraction return a/b as float

generateSortList create a sorted list of number.

generateSortList create a sorted list of number.

generateSortList create a sorted list of number.

* ------------------------------------------------------------------------ * Private methods * -------------------------------------------------

getUser returns a pointer of type user.

goroutine simulates sharing a value.

grabString knows how to take the specified bytes and convert those bytes into a string.

============================================================================= The index function declares that the value of type T must be compliant w

insertionSort takes a random list of numbers and uses the `iterative` process to sort it and return the sorted list. - Time Complexity O(n^2) - Auxili

linearSearchIterative takes a sorted/random list of numbers and uses the `iterative` process to check index by index to find the target. - the worst c

linearSearchRecursive takes a sorted/random list of numbers and uses the `recursive` process to check index by index to find the target.

moveLargest starts at the index positions specified in the list and attempts to move the largest number it can find to that position in the list.

newUser creates and returns pointers of user type values.

* -------------------------------------------------------------------------- * Bootstrap (v5.1.3): dom/manipulator.js * Licensed under MIT (http

notify implements a method notifies admins of different events.

notify implements a method with a value receiver.

oneChanceIn returns true one in n times.

player simulates a person playing the game of tennis.

============================================================================= This function provides a generics solution which allows a slice of any t

============================================================================= This function provides an empty interface solution which uses type asser

printHashes calculates the sha1 hash for a range of numbers and prints each in hex encoding.

============================================================================= This function provides a reflection solution which allows a slice of any

quickSort is an in-place sorting algorithm. It takes a random list of numbers, and uses the `recursive` process to divides it into partitions then sor

retrieve can read any device and process the data.

selectionSortIterative takes a random list of numbers and uses the `iterative` process to sort it and return the sorted list.

sendResponse marshals the provided value into json and returns that back to the caller.

setAge sets the age and displays the value.

stream performs the moving of the data stream from one goroutine to the other.

============================================================================= This function provides a generics solution which allows a slice of some

============================================================================= This function provides an empty interface solution which uses type asser

============================================================================= This function provides a reflection solution which allows a slice of any

Acquire retrieves a resource from the pool.

AddSort adds a node based on lexical ordering.

Cause iterates through all the wrapped errors until the root error value is reached.

CloseWithError closes the reader; subsequent writes to the write half of the pipe will return the error err. CloseWithError never overwrites the prev

CloseWithError closes the writer; subsequent reads from the read half of the pipe will return no Ts and the error err, or EOF if err is nil. CloseWit

ColumnTraverse traverses the matrix linearly down each column.

ConcurrentBounded uses a concurrent algorithm based on a bounded fan out and no channels.

ConcurrentBoundedChannel uses a concurrent algorithm based on a bounded fan out using a channel.

ConcurrentUnlimited uses a concurrent algorithm based on an unlimited fan out pattern.

Copy knows how to pull and store data from any System.

Copy knows how to pull and store data from any System.

Copy knows how to pull and store data from the System.

Copy knows how to pull and store data from any System.

Copy knows how to pull and store data from the System.

Copy knows how to pull and store data from any System.

Copy copies from src to dst until either EOF is reached on src or an error occurs. It returns the number of bytes copied and the first error encounter