Log in
Computer Science
3
answers
0
watching
266
views
7 Oct 2018

Part (d) [1 MARK] Some number of iterations of selection sort have been performed on a list, resulting in this list: [1, 2, 4, 5, 3, 8, 7, 6, 9] What is the maximum number of passes that could have been performed so far?

word_media_image1.png
Watch
3
answers
0
watching
266
views

For unlimited access to Homework Help, a Homework+ subscription is required.

Unlock all answers

Get 1 free homework help answer.
Already have an account? Log in
Share
Already have an account? Log in
Share
Jean Keeling
Jean KeelingLv2
9 Oct 2018
Already have an account? Log in
Share

Related questions

Part (c) [1 MARK List [6, 5, 2, 3, 7, 1, 4] is being sorted using insertion sort. Fill in the blanks to show the list after the next two passes. After one pass: After two passes: [6, 5, 2, 3, 7, 1, 4] [5, 6, 2, 3, 7, 1, 4] After three passes: After four passes:

1.Create a list that contains 10 successive integers starting with the value in the variable start. For example, if start is 7, the resulting list should be [7, 8, 9, 10, 11, 12, 13, 14, 15, 16]. Store the list in a variable named my_list. Assume that the value of start has already been set.
 
2.Create a list that is made up of the first half of the elements of a list called original_list. Store the new list in a variable called half_list. Assume that the original list has already been initialized and contains an even number of elements.
 
 
3. Write a predicate function called same_ends that accepts a list of integers and an integer (n) as arguments. Return True if the first n numbers in the list are the same as the last n numbers in the list, and False otherwise. For example, if the list was [1, 2, 3, 4, 99, 1, 2, 3, 4], the function would return True if n is 4 and False if n is 3. Assume that n is between 1 and the length of the list, inclusive.
 
4.Write a function called highest_values that accepts as arguments a list of numeric values and a single integer (n). The function should return a list made up of the largest n values from the argument list in order from lowest to highest. For example, if the argument list is [46, 82, 25, 61, 70, 33, 54] and n is 3, the return value should be [61, 70, 82]. Assume that the argument list contains at least n elements.
 
5.Assume that a list of integers stored in a variable named original contains exactly two elements that are zero. Write code that creates a separate list that contains the elements from original that are between the two zeros. Do not include the zeros in the new list. Store the list in a variable named between_zeros.
 
6. Write a function called price_range that accepts a list of floating-point numbers representing prices as an argument and returns the the difference between the highest price and the lowest price. Do NOT use the built-in functions max or min in your solution. Assume that all prices are positive values and that none of them exceed 10,000.00.
 
7. Write a function called count_vowels that accepts a string argument that represents a word and returns the number of vowels that are in the word. The vowels are A, E, I, O, and U (ignore the 'sometimes Y' rule). Count both uppercase and lowercase vowels.
 
8.
Assume that the variable table holds a two-dimensional list of integers. Write code that computes the sum of all elements in the table, assigning the result to the variable table_sum.

 

Question 7. [11 MARKS] This question has you write the bodies of two functions. Complete each function according to its docstring. Part (a) [6 MARKS] Note: you will most likely not need all of the space on this page. def count_letter_case (L): "" (list of list of str) -> list of tuple of int Precondition: each str in L is non-empty and contains only alphabetic characters Count the number of words in each sublist of L that start with lowercase and uppercase letters. Return a new list where each element is a two-item tuple in which the first item is the number of words in the list at the corresponding index of L that start with a lowercase letter and the second item is the number of words in the list at the corresponding index of L that start with an uppercase letter. >>> count_letter_case([['apple', 'Banana'], ['PEAR'], [], ['PEACH', 'apRICot', 'plum']]) [(1, 1), (0, 1), (0, 0), (2, 1)]

Related Documents

COMP 1005 Lecture Notes - Lecture 12: Sorting Algorithm, Mathematical Notation, Time Signature
coffeetortoise931
ACO 101
Final Exam
Study Guide
ACO 101 Study Guide - Final Guide: Selection Sort, Sorting Algorithm, Linear Search
jadetoad929
CP164 Lecture Notes - Lecture 3: G1 Phase, Radix Sort, If And Only If
azuretermite111

Weekly leaderboard

Home
Homework Help 3,900,000
Computer Science 2,000
Start filling in the gaps now
Log in