Write a program that animates the selection-sort algorithm. Create a list that consists of 20 distinct numbers from 1 to 20 in a random order. The elements are displayed in a histogram. Clicking the Step button causes the program to perform an iteration of the outer loop in the algorithm and repaints the histogram for the new list. Color the last bar in the sorted sublist. When the algorithm is finished, display a dialog box to inform the user. Clicking the Reset button creates a new random list for a new start.

Using Turtle, write a program that generates 1,000 lowercase letters randomly, counts the occurrence of each letter, and displays a histogram for the occurrences.

Write a program that generates 1,000 lowercase letters randomly, counts the occurrence of each letter, and displays a histogram for the occurrences.

Hint: Use Tkinter

Write the following function that draws a line from point p1 ([x1, y1]) to point p2 ([x2, y2]).

# Draw a line
def drawLine(p1, p2):

Write a function that counts the occurrences of each digit in a string using the following header:

def count(s):

The function counts how many times a digit appears in the string. The return value is a list of ten elements, each of which holds the count for a digit. For example, after executing counts = count("12203AB3"), counts[0] is 1, counts[1] is 1, counts[2] is 2, and counts[3] is 2.

Write a test program that prompts the user to enter a string and displays the number of occurrences of each digit in the string. Here is a sample run of the program:

Enter a string: 232534312 <enter>
1 occurs 1 time
2 occurs 3 times
3 occurs 3 times
4 occurs 1 time
5 occurs 1 time

Simplify ChineseZodiac.py, using a list of strings to store the animals’ names.

ChineseZodiac.py
1   year = eval(input("Enter a year: "))
2   zodiacYear = year % 12
3   if zodiacYear == 0:
4       print("monkey")
5   elif zodiacYear == 1:
6       print("rooster")
7   elif zodiacYear == 2:
8       print("dog")
9   elif zodiacYear == 3:
10      print("pig")
11  elif zodiacYear == 4:
12      print("rat")
13  elif zodiacYear == 5:
14      print("ox")
15  elif zodiacYear == 6:
16      print("tiger")
17  elif zodiacYear == 7:
18      print("rabbit")
19  elif zodiacYear == 8:
20      print("dragon")
21  elif zodiacYear == 9:
22      print("snake")
23  elif zodiacYear == 10:
24      print("horse")
25  else:
26      print("sheep")

Given lst = [30, 1, 2, 1, 0], what is the list after applying each of the following statements? Assume that each line of code is independent.

lst.append(40)
lst.insert(1, 43)
lst.extend([1, 43])
lst.remove(1)
lst.pop(1)
lst.pop()
lst.sort()
lst.reverse()
random.shuffle(lst)

Write a program that reads some integers between 1 and 100 and counts the occurrences of each. Here is a sample run of the program:

Enter integers between 1 and 100: 2 5 6 5 4 3 23 43 2 <enter>
2 occurs 2 times
3 occurs 1 time
4 occurs 1 time
5 occurs 2 times
6 occurs 1 time
23 occurs 1 time
43 occurs 1 time

Note that if a number occurs more than one time, the plural word “times” is used in the output.

Write a hangman game that randomly generates a word and prompts the user to guess one letter at a time, as shown in the sample run. Each letter in the word is displayed as an asterisk. When the user makes a correct guess, the actual letter is then displayed. When the user finishes a word, display the number of misses and ask the user whether to continue playing. Create a list to store the words, as follows:

# Use any words you wish
words = ["write", "that", "program", ...]

(Guess) Enter a letter in word ******* > p <enter>
(Guess) Enter a letter in word p****** > r <enter>
(Guess) Enter a letter in word pr**r** > p <enter>
p is already in the word
(Guess) Enter a letter in word pr**r** > o <enter>
(Guess) Enter a letter in word pro*r** > g <enter>
(Guess) Enter a letter in word progr** > n <enter>
n is not in the word
(Guess) Enter a letter in word progr** > m <enter>
(Guess) Enter a letter in word progr*m > a <enter>
The word is program. You missed 1 time
Do you want to guess another word? Enter y or n>

Write the following function that partitions the list using the first element, called a pivot:

def partition(lst):

After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition. Here is a sample run:

Enter a list: 10 1 5 16 61 9 11 1 <enter>
After the partition, the list is 9 1 5 1 10 61 11 16

Write the following function that tests whether the list has four consecutive numbers with the same value:

def isConsecutiveFour(values):

Write a test program that prompts the user to enter a series of integers and reports whether the series contains four consecutive numbers with the same value.

Write the following function that merges two sorted lists into a new sorted list:

def merge(list1, list2):

Implement the function in a way that takes len(list1) + len(list2) comparisons. Write a test program that prompts the user to enter two sorted lists and displays the merged list. Here is a sample run:

Enter list1: 1 5 16 61 111 <enter>
Enter list2: 2 4 5 6 <enter>
The merged list is 1 2 4 5 5 6 16 61 111

How do you modify the insertionSort function to sort elements in decreasing order?

Write a program that picks four cards from a deck of 52 cards and computes their sum. An ace, king, queen, and jack represent 1, 13, 12, and 11, respectively. Your program should display the number of picks that yield the sum of 24.