this python module takes an input of list of tupples representing edges in a graph
and it finds out the eulerian path.The input must contain nodes having even edges.The property of eulerian tour is t Run It Now!
this program takes input of list of numbers and gives the output of top k (e.g. top 20)
selections out of the enterd number.It returns top k elements but not in order. Run It Now!
This python module takes an input of list of numbers and outputs top k numbers out of them.the top k numbers are not in order.This doesn't involve sorting.So this takes comparitively lesser time...
Run It Now!
This python module finds Eulerian tour in a graph which is entered in a format of list having tupple of 2 elements.This basic concept is used in algoithms of social networking.In eulerian tour, all no Run It Now!
This python module finds the median of the numbers enterd in a list with a time complexity of O(nlog(n)), without modifying the list
It is way faster than the simple method of first sorting and then Run It Now!
Run It Now!
facebook
twitter
linkedin
blog