## return maximum

0 likes • Nov 19, 2022
Python

## More Python Posts

```my_list = [1, 2, 3, 4, 5]removed_element = my_list.pop(2)  # Remove and return element at index 2print(removed_element)  # 3print(my_list)  # [1, 2, 4, 5]
last_element = my_list.pop()  # Remove and return the last elementprint(last_element)  # 5print(my_list)  # [1, 2, 4]```
`""" Number Guessing Game----------------------------------------"""import randomattempts_list = []def show_score():    if len(attempts_list) <= 0:        print("There is currently no high score, it's yours for the taking!")    else:        print("The current high score is {} attempts".format(min(attempts_list)))def start_game():    random_number = int(random.randint(1, 10))    print("Hello traveler! Welcome to the game of guesses!")    player_name = input("What is your name? ")    wanna_play = input("Hi, {}, would you like to play the guessing game? (Enter Yes/No) ".format(player_name))    // Where the show_score function USED to be    attempts = 0    show_score()    while wanna_play.lower() == "yes":        try:            guess = input("Pick a number between 1 and 10 ")            if int(guess) < 1 or int(guess) > 10:                raise ValueError("Please guess a number within the given range")            if int(guess) == random_number:                print("Nice! You got it!")                attempts += 1                attempts_list.append(attempts)                print("It took you {} attempts".format(attempts))                play_again = input("Would you like to play again? (Enter Yes/No) ")                attempts = 0                show_score()                random_number = int(random.randint(1, 10))                if play_again.lower() == "no":                    print("That's cool, have a good one!")                    break            elif int(guess) > random_number:                print("It's lower")                attempts += 1            elif int(guess) < random_number:                print("It's higher")                attempts += 1        except ValueError as err:            print("Oh no!, that is not a valid value. Try again...")            print("({})".format(err))    else:        print("That's cool, have a good one!")if __name__ == '__main__':    start_game()`
```import anytree as atimport 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]```
```import random
# Define the ranks, suits, and create a deckranks = ['Ace', '2', '3', '4', '5', '6', '7', '8', '9', '10', 'Jack', 'Queen', 'King']suits = ['Hearts', 'Diamonds', 'Clubs', 'Spades']deck = [(rank, suit) for rank in ranks for suit in suits]
# Shuffle the deckrandom.shuffle(deck)
# Display the shuffled deckfor card in deck:    print(card[0], "of", card[1])```
```# Python code to demonstrate# method to remove i'th character# Naive Method
# Initializing Stringtest_str = "CodeCatch"
# Printing original stringprint ("The original string is : " + test_str)
# Removing char at pos 3# using loopnew_str = ""
for i in range(len(test_str)):	if i != 2:		new_str = new_str + test_str[i]
# Printing string after removalprint ("The string after removal of i'th character : " + new_str)```

### 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]),```