Pop an element off of the top of the stack.

Return true if the elements u and v belongs to the same set

input: index (start at 0) output: the i-th component of the vector.

Tries to find word in a Trie :param word: word to look for :return: Returns True if word is found, False otherwise

input: positive integer 'number' returns true if 'number' is prime otherwise false.

Union of the sets u and v. Complexity: log(n). Amortized complexity: < 5 (it's very fast).

Check if a stack is empty.

predict: @param x: a floating point value to predict the label of the prediction function works by recursively calling the pr

The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m) 1) Preprocess pattern to identify

Push an element to the top of the stack.

The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(nm), most efficient when it is used with multiple pa

Finds root from the point 'a' onwards by Newton-Raphson method

Get the element set root. This uses the heuristic path compression See wikipedia article for more details.

Raises ValueError if element is not in range

r''' A B / \ / \ B C Bl A / \ -->

Peek at the top-most element of the stack.

input: positive integer 'number' returns a list of the prime number factors of 'number'

[summary] Converts the given integer into 8-digit hex number. Arguments: i {[int]} -- [integer]

a mirror symmetry rotation of the leftrotation

Function to fins absolute value of numbers. >>absVal(-5) 5 >>absVal(0) 0

input: an index (pos) and a value changes the specified component (pos) with the 'value'

mean_squared_error: @param labels: a one dimensional numpy array @param prediction: a floating point value return va

[summary] Regroups the given binary string. Arguments: bitString32 {[string]} -- [32 bit binary] Raises: ValueError -- [if the given string

Static method to be used inside other methods. Left rotates n by b.