Enter first value then second value and it will compute the GCF.
Made a few changes: see code comments. Old version would have failed on GCD(24,36) for example.
This python module takes input as list of nodes and returns a ring Graph(dictionary).
In which elements are connected to one another in a sequence and last and first element is also connected. Run It Now!
this python module takes an input of list of numbers and returns the median without using any sorting method and is quicker than those methods.time complexity is O(k log(n)). Run It Now!
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!
Run It Now!
facebook
twitter
linkedin
blog