Consider the problem of sorting a list of 10 elements from smallest to largest. Which of the following statements must be true of the state of the list after five iterations of the outer loop of selectionsort? (Select all that apply) Question 2 options: A) The list is sorted. B) The first five elements are sorted. C) The last five elements are the largest in the list. D) The last five elements are sorted

Consider the problem of sorting a list of 10 elements from smallest to largest. Which of the following statements must be true of the state of the list after five iterations of the outer loop of selectionsort? (Select all that apply) Question 2 options: A) The list is sorted. B) The first five elements are sorted. C) The last five elements are the largest in the list. D) The last five elements are sorted

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Select which of the following statements about searching for items in a list is incorrect. Group of answer choices 1. In an unsorted list, if the item is not present in the list, we will need to check every single item. In a sorted list, if we start the search at the smallest item, at most we would only need to check all items smaller than the target. If we get to an item larger than the target we can end our search early. This would make searching faster in the sorted list. 2. Sorting a list only makes sense for primitive types (ints, doubles) and Strings but not objects. For this reason we cannot sort a list of objects, and will always have to check each object in a list when we search for a target object. 3. In an unsorted list you need to check each item, to see if it is the item you want. If the list is sorted you can look at the middle item and then you can direct your search to the relevant portion of the list (higher or lower). This is called binary search. This will…
1. If you are given -A list of bad words (in a language you don’t know) -A long document (in that same language) How would you describe the process of looking through the document and crossing out the bad words? 2. When you are given a list of words, and are asked to add onto said list, where would you add the new words? Why would you put them there? 3. There are three kinds of loops: While loop For loop Do-while loop How would you make a for loop behave like a while loop? 4. How would you make a while loop behave like a for loop? Let’s say you had a list of word fragments. For example, the ones below ap, pie, bi, pan, da, uni, cycle If we asked you to make words that you know from these words, you’d quickly come up with a number of words. If you were doing this as an assignment, it may only take you a few minutes to come up with every combination. How would you do this with a list of word fragments too long to put on one page? (You don’t have to have a perfect algorithm…
Python Programming:- thislist = ["apple", "banana", "melon", "cherry", "orange", "kiwi", "mango"] # Using the given list above, write a quick python script that## a. First, outputs only the FIRST 3 elements from the list# b. Second, outputs the LAST 3 elements from the list# c. Third, outputs ONLY the elements whose first letter is "m"# d. Last, outputs ONLY the last element from the list
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
8.17 LAB: Filter and sort a list Write a program that gets a list of integers from input, and outputs non-negative integers in ascending order (lowest to highest). Ex: If the input is: 10 -7 4 39 -6 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space. Do not end with newline. Use Python, please.
1. Practice Conditional Expressions: python Write a function, record_result, that returns “Record Broken!” if the first parameter is less than the second parameter and “Record remains unchanged” otherwise. Do this in one line using a conditional expression. print(record_result(2.31,2.32)) 2. Practice Sets: python Write a function, sort_unique, that returns a list of cities sorted alphabetically after duplicates have been removed. Do this in one line using casting. print(sort_unique(["NYC","ATL","ATL"]))
In your essay, you should discuss at least two advantages and disadvantages of skipping the skip list.
Implement a function void printAll(void) to print all the items of the list.
A list is given an = {6,2,-4,13,7} Answer the following questions. a. What is n in an? b. List all the steps of sorting this list using insertion sort. c. What is the output of this search? And what does it indicate?
Problem Description We've already made arraying/listing the easy way, but how about arraying/listing and printing the list in reverse order? Make a program that will input an integer and then using loops, add items on an array/list one by one for the same number of times as that of the first inputted integer. Then, print out the array/list in reverse order, that is, starting from the last item on the array/list down to the first one, each in separate lines. Input The first line contains the size of the array/list. The next lines contains the items of the array/list (integers). 5 1 64 32 2 11 Output Multiple lines containing integers. 11 2 32 64 1 Problem Description Did you know that you can also reverse lists and group them according to your liking with proper code? Input The first line contains an odd positive integer. The next lines contains an integer. 5 1 3 4 5 2 Output A line containing a list. [2,5]-[4]-[3,1] -USED JAVA PROGRAMMING LANGUAGE
Python Exercise: Given a sorted list of integers, output "Middle item: " followed by the middle integer. Assume the number of integers is always odd. Ex: If the input is: 2 3 4 8 11 the output is: Middle item: 4 The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs". Hint: First read the data into a list. Then, based on the list's size, find the middle item.
## Given the stubs for the following function ## and the main program, complete the implementation.## Finish the 3 assert statements to properly## assert the result shown below (be careful ## with the types of the variables).def get_list_avg(________________): """ Given a list of numerical values in STRINGS, iterate over these elements until a negative value is found. Return the average of the positive numbers in these strings that are in the list that came **before** the first negative element. If the list is empty, return -1. For example, if the list is this: ['10', '1', '6', '3', '-1', '5', '9'] then the function returns (10 + 1 + 6 + 3) / 4, which is 5.0 """ passif __name__ == "__main__": ### Write 3 assert statements ### to test the function assert ...