-) Define a function printList(0 with one parameter p. 1) This function prints all values in the list p. ) Define a main() function to do the following: 1) Create a list of strings called Ist. For example, Ist = ["apple", “banana", “cherry"]. 2) Call the function printList() with Ist as an argument. ) Call main() function to initiate the tasks to be performed.

-) Define a function printList(0 with one parameter p. 1) This function prints all values in the list p. ) Define a main() function to do the following: 1) Create a list of strings called Ist. For example, Ist = ["apple", “banana", “cherry"]. 2) Call the function printList() with Ist as an argument. ) Call main() function to initiate the tasks to be performed.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

6.37 LAB: Multiples of ten in a vector Write a program that reads a list of integers, and outputs whether the list contains all multiples of 10, no multiples of 10, or mixed values. Define a function named IsVectorMult10 that takes a vector as a parameter, representing the list, and returns a boolean that represents whether the list contains all multiples of ten. Define a function named IsVectorNoMult10 that takes a vector as a parameter, representing the list, and returns a boolean that represents whether the list contains no multiples of ten. Then, write a main program that takes an integer, representing the size of the list, followed by the list values. The first integer is not in the list. Ex: If the input is: 5 20 40 60 80 100 the output is: all multiples of 10 Ex: If the input is: 5 11 -32 53 -74 95 the output is: no multiples of 10 Ex: If the input is: 5 10 25 30 40 55 the output is: mixed values The program must define and call the following two functions. IsVectorMult10…
#### Part 1 Write a Python function (`binary_search`) that implements the binary search algorithm. This function will take a list argument (`values`), a value to search for (`to_find`), a start index (`start_index`), and an end index (`end_index`). The function will return `True` if `to_find` is present in `values`, and `False` otherwise. Below, you will find some code to test your binary search: ```python values = [2,4,6,8,10,12,14,16,18,20] print(binary_search(values, 14, 0, len(values) - 1)) print(binary_search(values, 7, 0, len(values) - 1)) ``` The output of the test code is below: ``` True False ``` #### Part 2 Modify your `binary_search` function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the `True` or `False` result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Some…
Data Structure Using C++ (Recursion) Need C++ Code ::: DON'T USE STACK PLEASE JUST Recursion This is a one question >>> 6 function in one code ....... don't use cin please Without using stack just Recursion please Write the following recursive functions once for an array and once for simply linked list (as member functions)1. to print all odd elements in backwards order.2. to count number of values that are below 10.3. to find maximum value. Run your functions on the following array 2,7,12,5,0,3,44,1,26and the following list 4,1,10,3,0,5,24,7,40 6 functions 3 for simply linked list and 3 for array like picture need please
(C Language) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.
1. Write a function called chop that takes a list, modifies it by removing the first and last elements, and returns None. For example: >>> t = [1, 2, 3, 4, 5, 6] >>> chop(t) >>> t [2, 3, 4, 5] 2. Write a function called list_median that takes a list and returns a new list. If the list has even numbers of elements, the new list will have two elements. If the list has odd numbers of elements, the new list will include only one element. For example: >>> t1 = [5, 1, 2, 3, 4] >>> list_median(t1) [3] >>> t2 = [8, 3, 10, 6] >>> list_median(t2) [6, 8] 3. Write a function called has_duplicates that takes a list and returns True if there is any element that appears more than once. It should not modify the original list. For example: >>> t1 = [5, 1, 2, 3, 4] >>> has_duplicates(t1) False >>> t2 = [5, 1, 2, 3, 2, 8, 10] >>> has_duplicates(t2) True
8.19 (Removing a Particular Word From a Given Line of Text) Write a program that inputs a line of text and a given word. The program should use string library functions strcmp and strcpy to remove all occurrences of the given word from the input line of text. The program should also count the number of words in the given line of text before and after removing the given word using the strtok function. Solve it Without using pointers
Data Structure Using C++ (Recursion) Need C++ Code ::: This is a one question >>> 6 function in one code ....... don't use cin please Write the following recursive functions once for an array and once for simply linked list (as member functions)1. to print all odd elements in backwards order.2. to count number of values that are below 10.3. to find maximum value. Run your functions on the following array 2,7,12,5,0,3,44,1,26and the following list 4,1,10,3,0,5,24,7,40 6 functions 3 for simply linked list and 3 for array
Data Structure Using C++ (Recursion) Need C++ Code ::: This is a one question >>> 6 function in one code ....... don't use cin please Write the following recursive functions once for an array and once for simply linked list (as member functions)1. to print all odd elements in backwards order.2. to count number of values that are below 10.3. to find maximum value. Run your functions on the following array 2,7,12,5,0,3,44,1,26and the following list 4,1,10,3,0,5,24,7,40 6 functions 3 for simply linked list and 3 for array like picture need please
10.20 LAB: Multiples of ten in a list Write a program that reads a list of integers, and outputs whether the list contains all multiples of 10, no multiples of 10, or mixed values. Define a function named is_list_mult10 that takes a list as a parameter, and returns a boolean that represents whether the list contains all multiples of ten. Define a function named is_list_no_mult10 that takes a list as a parameter and returns a boolean that represents whether the list contains no multiples of ten. Then, write a main program that takes an integer, representing the size of the list, followed by the list values. The first integer is not in the list. Ex: If the input is: 5 20 40 60 80 100 the output is: all multiples of 10 Ex: If the input is: 5 11 -32 53 -74 95 the output is: no multiples of 10 Ex: If the input is: 5 10 25 30 40 55 the output is: mixed values The program must define and call the following two functions. is_list_mult10() returns true if all integers in the list are…
Define a function called list_split_and_reverse(a_list) that takes a list as input. If the list is empty, print "List is empty, fail!" and return nothing. If the list has an odd number of elements print "List has odd number of elements, fail!" and return nothing. Otherwise split the list into two entirely new lists, one containing the first half of the elements, and the other containing the other half. Reverse the back-half/second list >>> a_list = [0, 2, 3, 7, 10, 20]>>> result = list_split_and_reverse([])Output: List is empty, fail! # result is also empty/None>>> result = list_split_and_reverse(a_list[:-1])Output: List has odd number of elements, fail! # result is also empty/None>>> result = list_split_and_reverse(a_list)>>> print(result)Output: ([0, 2, 3], [20, 10, 7])>>> result1, result2 = list_split_and_reverse([0, 1, 2, 4])>>> print(result1)Output: [0, 1]>>> print(result2)Output: [4, 2]
PLZ write in SML language. Thank you Write a function maxGroup that determines, for a given integer list, the stored number of the longest consecutive group of equal numbers. For example, maxGroup [2, 9, 8, 8, 8, 7, 9, 1] should return 8 since there are three consecutive 8s in the list. Hint: Solve the problem in two steps. First, determine the length of each group of equal numbers. Then, determine which is the largest.
Insert and merge: Write a function insert_and_merge : (’a * int) list -> ’a * int -> (’ a * int) list = that takes a (’a * int) list, sorted in increasing order with respect to the first tuple value we call the key, and an element ’a * int. The function inserts the element at the appropriate position so the list remains sorted and outputs said list. Assume there are no duplicate keys and thus if the new element has the same key as another element in the list, the function sums their values instead. Sorting the list is not allowed. (in oCaml)