import itertools

def compute_permutations(string):
    # Generate all permutations of the string
    permutations = itertools.permutations(string)

    # Convert each permutation tuple to a string
    permutations = [''.join(permutation) for permutation in permutations]

    return permutations

# Prompt the user for a string
string = input("Enter a string: ")

# Compute permutations
permutations = compute_permutations(string)

# Display the permutations
print("Permutations:")
for permutation in permutations:
    print(permutation)

my_list = [1, 2, 3, 4, 5]
removed_element = my_list.pop(2)  # Remove and return element at index 2
print(removed_element)  # 3
print(my_list)  # [1, 2, 4, 5]

last_element = my_list.pop()  # Remove and return the last element
print(last_element)  # 5
print(my_list)  # [1, 2, 4]

import random

class Node:

    def __init__(self, c):

        self.left = None
        self.right = None
        self.color = c
    
    def SetColor(self,c) :
        self.color = c

    def PrintNode(self) :
        print(self.color)

def insert(s, root, i, n):
    if i < n:
        temp = Node(s[i]) 
        root = temp 
        root.left = insert(s, root.left,2 * i + 1, n) 
        root.right = insert(s, root.right,2 * i + 2, n)
    return root
  

def MakeTree(s) :
    list = insert(s,None,0,len(s))
    return list


def MakeSet() :
    s = []
    count = random.randint(7,12)
    for _ in range(count) :
        color = random.randint(0,1) == 0 and "Red" or "White"
        s.append(color)
    return s

def ChangeColor(root) :
    if (root != None) :
        if (root.color == "White") :
            root.SetColor("Red")
        ChangeColor(root.left)
        ChangeColor(root.right)


def PrintList(root) :
    if root.left != None :
        PrintList(root.left)
    else :
        root.PrintNode()
    if root.right != None :
        PrintList(root.right)
    else :
        root.PrintNode()


t1 = MakeTree(MakeSet())
print("Original Colors For Tree 1:\n")
PrintList(t1)
ChangeColor(t1)
print("New Colors For Tree 1:\n")
PrintList(t1)

t2 = MakeTree(MakeSet())
print("Original Colors For Tree 2:\n")
PrintList(t2)
ChangeColor(t2)
print("New Colors For Tree 2:\n")
PrintList(t2)

t3 = MakeTree(MakeSet())
print("Original Colors For Tree 3:\n")
PrintList(t3)
ChangeColor(t3)
print("New Colors For Tree 3:\n")
PrintList(t3)

import anytree as at
import random as rm

# Generate a tree with node_count many nodes. Each has a number key that shows when it was made and a randomly selected color, red or white.
def random_tree(node_count):
    
    # Generates the list of nodes
    nodes = []
    for i in range(node_count):
        test = rm.randint(1,2)
        if test == 1:
            nodes.append(at.Node(str(i),color="white"))
        else:
            nodes.append(at.Node(str(i),color="red"))
    
    #Creates the various main branches
    for i in range(node_count):
        for j in range(i, len(nodes)):
            test = rm.randint(1,len(nodes))
            if test == 1 and nodes[j].parent == None and (not nodes[i] == nodes[j]):
                nodes[j].parent = nodes[i]
    
    #Collects all the main branches into a single tree with the first node being the root
    for i in range(1, node_count):
        if nodes[i].parent == None and (not nodes[i] == nodes[0]):
            nodes[i].parent = nodes[0]

    return nodes[0]

def print_pyramid_pattern(n):
     
    # outer loop to handle number of rows
    # n in this case
    for i in range(0, n):
     
        # inner loop to handle number of columns
        # values changing acc. to outer loop
        for j in range(0, i+1):
         
            # printing stars
            print("* ",end="")
      
        # ending line after each row
        print("\r")
 
print_pyramid_pattern(10)

# 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 order
def 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 order
def sort(a,N, up):
	bitonicSort(a,0, N, up)

# Driver code to test above
a = [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]),