## Bitonic sort

0 likes • Nov 19, 2022 • 0 views
Python

## More Python Posts

#### Calculator

0 likes • Nov 19, 2022 • 0 views
Python
`""" Calculator----------------------------------------"""def addition ():    print("Addition")    n = float(input("Enter the number: "))    t = 0 //Total number enter    ans = 0    while n != 0:        ans = ans + n        t+=1        n = float(input("Enter another number (0 to calculate): "))    return [ans,t]def subtraction ():    print("Subtraction");    n = float(input("Enter the number: "))    t = 0 //Total number enter    sum = 0    while n != 0:        ans = ans - n        t+=1        n = float(input("Enter another number (0 to calculate): "))    return [ans,t]def multiplication ():    print("Multiplication")    n = float(input("Enter the number: "))    t = 0 //Total number enter    ans = 1    while n != 0:        ans = ans * n        t+=1        n = float(input("Enter another number (0 to calculate): "))    return [ans,t]def average():    an = []    an = addition()    t = an[1]    a = an[0]    ans = a / t    return [ans,t]// main...while True:    list = []    print(" My first python program!")    print(" Simple Calculator in python by Malik Umer Farooq")    print(" Enter 'a' for addition")    print(" Enter 's' for substraction")    print(" Enter 'm' for multiplication")    print(" Enter 'v' for average")    print(" Enter 'q' for quit")    c = input(" ")    if c != 'q':        if c == 'a':            list = addition()            print("Ans = ", list[0], " total inputs ",list[1])        elif c == 's':            list = subtraction()            print("Ans = ", list[0], " total inputs ",list[1])        elif c == 'm':            list = multiplication()            print("Ans = ", list[0], " total inputs ",list[1])        elif c == 'v':            list = average()            print("Ans = ", list[0], " total inputs ",list[1])        else:            print ("Sorry, invilid character")    else:        break`

#### Topological sort

0 likes • Nov 19, 2022 • 0 views
Python
`#Python program to print topological sorting of a DAGfrom collections import defaultdict  #Class to represent a graphclass Graph:    def __init__(self,vertices):        self.graph = defaultdict(list) #dictionary containing adjacency List        self.V = vertices #No. of vertices      # function to add an edge to graph    def addEdge(self,u,v):        self.graph[u].append(v)      # A recursive function used by topologicalSort    def topologicalSortUtil(self,v,visited,stack):          # Mark the current node as visited.        visited[v] = True          # Recur for all the vertices adjacent to this vertex        for i in self.graph[v]:            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Push current vertex to stack which stores result        stack.insert(0,v)      # The function to do Topological Sort. It uses recursive     # topologicalSortUtil()    def topologicalSort(self):        # Mark all the vertices as not visited        visited = [False]*self.V        stack =[]          # Call the recursive helper function to store Topological        # Sort starting from all vertices one by one        for i in range(self.V):            if visited[i] == False:                self.topologicalSortUtil(i,visited,stack)          # Print contents of stack        print(stack)  g= Graph(6)g.addEdge(5, 2);g.addEdge(5, 0);g.addEdge(4, 0);g.addEdge(4, 1);g.addEdge(2, 3);g.addEdge(3, 1);  print("Following is a Topological Sort of the given graph")g.topologicalSort()`

#### Plotting Fibonacci

0 likes • Nov 19, 2022 • 0 views
Python
`# Python program for Plotting Fibonacci # spiral fractal using Turtle import turtle import math   def fiboPlot(n):     a = 0    b = 1    square_a = a     square_b = b       # Setting the colour of the plotting pen to blue     x.pencolor("blue")       # Drawing the first square     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)       # Proceeding in the Fibonacci Series     temp = square_b     square_b = square_b + square_a     square_a = temp           # Drawing the rest of the squares     for i in range(1, n):         x.backward(square_a * factor)         x.right(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)           # Proceeding in the Fibonacci Series         temp = square_b         square_b = square_b + square_a         square_a = temp       # Bringing the pen to starting point of the spiral plot     x.penup()     x.setposition(factor, 0)     x.seth(0)     x.pendown()       # Setting the colour of the plotting pen to red     x.pencolor("red")       # Fibonacci Spiral Plot     x.left(90)     for i in range(n):         print(b)         fdwd = math.pi * b * factor / 2        fdwd /= 90        for j in range(90):             x.forward(fdwd)             x.left(1)         temp = a         a = b         b = temp + b     # Here 'factor' signifies the multiplicative  # factor which expands or shrinks the scale # of the plot by a certain factor. factor = 1  # Taking Input for the number of  # Iterations our Algorithm will run n = int(input('Enter the number of iterations (must be > 1): '))   # Plotting the Fibonacci Spiral Fractal  # and printing the corresponding Fibonacci Number if n > 0:     print("Fibonacci series for", n, "elements :")     x = turtle.Turtle()     x.speed(100)     fiboPlot(n)     turtle.done() else:     print("Number of iterations must be > 0")`

#### find parity outliers

0 likes • Nov 19, 2022 • 0 views
Python
```from collections import Counter
def find_parity_outliers(nums):  return [    x for x in nums    if x % 2 != Counter([n % 2 for n in nums]).most_common()[0][0]  ]
find_parity_outliers([1, 2, 3, 4, 6]) # [1, 3]```

#### clamp number

0 likes • Nov 19, 2022 • 0 views
Python
`def clamp_number(num, a, b):  return max(min(num, max(a, b)), min(a, b))  clamp_number(2, 3, 5) # 3clamp_number(1, -1, -5) # -1`

#### return maximum

0 likes • Nov 19, 2022 • 0 views
Python
```def max_n(lst, n = 1):  return sorted(lst, reverse = True)[:n]
max_n([1, 2, 3]) # [3]max_n([1, 2, 3], 2) # [3, 2]```