## Factorial of N

0 likes • Nov 19, 2022
Python

## More Python Posts

```# Listlst = [1, 2, 3, 'Alice', 'Alice']
# One-Linerindices = [i for i in range(len(lst)) if lst[i]=='Alice']
# Resultprint(indices)# [3, 4]```
```primes=[]products=[]
def prime(num):    if num > 1:        for i in range(2,num):            if (num % i) == 0:                return False        else:            primes.append(num)            return True
for n in range(30,1000):    if len(primes) >= 20:        break;    else:        prime(n)
for previous, current in zip(primes[::2], primes[1::2]):    products.append(previous * current)    print (products)```
```# Python program to reverse a linked list# Time Complexity : O(n)# Space Complexity : O(n) as 'next'#variable is getting created in each loop.
# Node class

class Node:
# Constructor to initialize the node object	def __init__(self, data):		self.data = data		self.next = None

# Function to reverse the linked list	def reverse(self):		prev = None		current = self.head		while(current is not None):			next = current.next			current.next = prev			prev = current			current = next		self.head = prev
# Function to insert a new node at the beginning	def push(self, new_data):		new_node = Node(new_data)		new_node.next = self.head		self.head = new_node
# Utility function to print the linked LinkedList	def printList(self):		temp = self.head		while(temp):			print temp.data,			temp = temp.next

# Driver program to test above functionsllist = LinkedList()llist.push(20)llist.push(4)llist.push(15)llist.push(85)

### Bitonic sort

CodeCatch
0 likes • Nov 19, 2022
Python
```# Python program for Bitonic Sort. Note that this program# works only when size of input is a power of 2.
# The parameter dir indicates the sorting direction, ASCENDING# or DESCENDING; if (a[i] > a[j]) agrees with the direction,# then a[i] and a[j] are interchanged.*/def compAndSwap(a, i, j, dire):	if (dire==1 and a[i] > a[j]) or (dire==0 and a[i] > a[j]):		a[i],a[j] = a[j],a[i]
# It recursively sorts a bitonic sequence in ascending order,# if dir = 1, and in descending order otherwise (means dir=0).# The sequence to be sorted starts at index position low,# the parameter cnt is the number of elements to be sorted.def bitonicMerge(a, low, cnt, dire):	if cnt > 1:		k = cnt/2		for i in range(low , low+k):			compAndSwap(a, i, i+k, dire)		bitonicMerge(a, low, k, dire)		bitonicMerge(a, low+k, k, dire)
# This funcion first produces a bitonic sequence by recursively# sorting its two halves in opposite sorting orders, and then# calls bitonicMerge to make them in the same orderdef bitonicSort(a, low, cnt,dire):	if cnt > 1:		k = cnt/2		bitonicSort(a, low, k, 1)		bitonicSort(a, low+k, k, 0)		bitonicMerge(a, low, cnt, dire)
# Caller of bitonicSort for sorting the entire array of length N# in ASCENDING orderdef sort(a,N, up):	bitonicSort(a,0, N, up)
# Driver code to test abovea = [3, 7, 4, 8, 6, 2, 1, 5]n = len(a)up = 1
sort(a, n, up)print ("\n\nSorted array is")for i in range(n):	print("%d" %a[i]),```
```import mysql.connector
```from collections import Counter