The DFS function simply calls itself recursively for every unvisited child of its argument. We can emulate that behaviour precisely using a stack

DFS traversal

Function to encrypt text using psedo-random numbers

>>> encryptMessage('LFWOAYUISVKMNXPBDCRJTQEGHZ', 'Harshil Darji') 'Ilcrism Olcvs'

>>> encryptMessage('HDarji', 'This is Harshil Darji from Dharmaj.') 'Akij ra Odrjqqs Gaisq muod Mphumrs.'

>>> encryptMessage(4545, 'The affine cipher is a type of monoalphabetic substitution cipher.') 'VL}p MM{I}p~{HL}Gp{vp pFsH}pxMpyxIx JHL O}F{~

>>> encryptMessage(6, 'Harshil Darji') 'Hlia rDsahrij'

input: 'content' of type string and 'key' of type int output: encrypted string 'content' if key not passed the method uses the key by the co

returns the eulidean length of the vector

2 1 3 1 4 3 5 2 6 1 7 2 8 6 9 8 10 8 On removing edges (1,3) and (1,6), we can get the desired result 2.

Takes a bytestring-block of length 64, unpacks it to a list of integers and returns a list of 80 integers pafter some bit operations

Returns a list of all the even terms in the Fibonacci sequence that are less than n.

Greatest common divisor input: two positive integer 'number1' and 'number2' returns the greatest common divisor of 'number1'

[summary] Iterator: Returns by each call a list of length 16 with the 32 bit integer blocks. Arguments: bitString {[string]} -- [binary stri

input: positive integer 'n' >= 1 returns all divisors of n (inclusive 1 and 'n')

input: positive integer 'N' > 2 returns a list of prime numbers from 2 up to N (inclusive) This function is more efficient as

:param index: index of the parameter vector wrt to derivative is to be calculated :return: derivative wrt to that index Note: If index is

Randomly choose k data points as initial centroids

Pure implementation of the gnome sort algorithm in Python.

Pure implementation of the heap sort algorithm in Python :param collection: some mutable ordered collection with heterogeneous comparable

Convert infix notation to postfix notation using the Shunting-yard algorithm. https://en.wikipedia.org/wiki/Shunting-yard_algorithm http

Inserts a word into the Trie :param word: word to be inserted :return: None

Inserts a list of words into the Trie :param words: list of string words :return: None

Pure implementation of interpolation search algorithm in Python Be careful collection must be sorted, otherwise result will be unpredictable