def eliminate_neighbours (items ) : Given the sequence of integer items that are guaranteed to be some permutation of positive integers from 1 to n where n is the length of the list, find the smallest number among those that still remain in the list, and remove from the list both that number and whichever of its current immediate neighbours is larger. The function should repeat this basic operation until the largest number in the original list gets eliminated. Return the number of removal operations that were needed to achieve this goal. For example, given the list [5, 2, 1, 4, 6, 3], the operation would remove element 1 and its current larger neighbour 4, resulting in the list [5, 2, 6, 3]. Applied again, that operation would remove 2 and its current larger neighbour 6, thus reaching the goal in two steps.

def eliminate_neighbours (items ) : Given the sequence of integer items that are guaranteed to be some permutation of positive integers from 1 to n where n is the length of the list, find the smallest number among those that still remain in the list, and remove from the list both that number and whichever of its current immediate neighbours is larger. The function should repeat this basic operation until the largest number in the original list gets eliminated. Return the number of removal operations that were needed to achieve this goal. For example, given the list [5, 2, 1, 4, 6, 3], the operation would remove element 1 and its current larger neighbour 4, resulting in the list [5, 2, 6, 3]. Applied again, that operation would remove 2 and its current larger neighbour 6, thus reaching the goal in two steps.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Alert dont submit AI generated answer. please explain in details. Please print fixlist function so it would print out both lists a = [1, 5, 3, 6] b = [3, 5, 3 ,2, 4, 6, 8, 5, 2] def printList(list): for i in range(9): print(list[i]) print("End of List" print list(a) printList(b) Expected output: 1 5 3 6 End of List 3 5 3 2 4 6 8 5 2
We will start by finding the largest value. Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is initialized to the first element in the array. We then compare the element that maxValue is storing with every element in the list. Whenever we find an element in the array larger than the element that maxValue is storing, we update maxValue so that it stores the value of the newer larger element. Algorithm ArrayLargestElement Declare and initialize maxValue to the first element in the array. Use a FOR loop to traverse the array. // You already checked the first element, so you should start the loop at the second element. If the element at this index is larger than maxValue Update maxValue Output maxValue. Write a program MyArray_ABC that declares an array containing the following elements: 45, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 78, and outputs the largest value. PART B. Modify the program described…
Question in image Please explain how to do with the answer. Thank you.
Exact change only def give_change(amount, coins): Given the amount of money (expressed as an integer as the total number of kopecks of Poldavia, Ruritania, Montenegro or some other such vaguely Eastern European 0ictional country that Tintin and similar fellows would visit) and the list of available denominations of coins (similarly expressed as kopecks), create and return a list of coins that add up to the amount using the greedy approach where you use as many of the highest denomination coins when possible before moving on to the next lower denomination. The list of coin denominations is guaranteed to be given in descending sorted order, as should your returned result also be. amount coins Expected result 64 [50, 25, 10, 5, 1] [50, 10, 1, 1, 1, 1] 123 [100, 25, 10, 5, 1] [100, 10, 10, 1, 1, 1] 100 [42, 17, 11, 6, 1] [42, 42, 11, 1, 1, 1, 1, 1] This problem, along with its countless variations, is a computer…
• find_last(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the last element of the list which is equal to the second input; if it cannot be found, returns None instead. >> find_last(['a', 'b', 'b', 'a'], 'b') 2 >>> ind = find_last(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None
Homework 7: Merging two sorted arrays Due date: Saturday March 18. Objectives: Learn to implement algorithms that work with multiple arrays. Understand the Merging algorithm. IMPORTANT. Carefully study Lecture 1 from Week 8 on D2L before you start on this. Sometimes we need to combine the values in two sorted sequences to produce a larger sorted sequence. This process is called Merging. As an example, if the first sequence (S1)contains the numbers 2 3 4 4 5 9 and the second sequence (S2) contains the numbers 1 4 5 8 9 11 12 13 17 the output sequence will contain 1 2 3 4 4 4 5 5 8 9 9 11 12 13 17 Each sequence can be stored in an array. The strategy is as follows: Start by comparing the first items in the two input arrays. Write the smaller number to the output array, and move to the the next item in that array. This is repeated until we reach the end of any one of the input arrays; thereafter, we simply copy all the numbers from the other input array to the output array. (In the…
def city_dict(adict): """ Question 6 -Given a dictionary that maps a person to a list of countries they want to travel to, return a dictionary with the value being the list sorted by the last letter in each countries name. If two countries have the same last letter, sort by the first letter. -For an extra challenge, try doing this in one line (Optional). Args: adict (dict) Returns: dict >>> city_dict({"Pablo": ["Belgium", "Canada", "Germany"], "Athena": ["Italy", "France", "Egypt"], "Liv": ["Japan", "Bolivia", "Greece"]}) {'Pablo': ['Canada', 'Belgium', 'Germany'], 'Athena': ['France', 'Egypt', 'Italy'], 'Liv': ['Bolivia', 'Greece', 'Japan']} >>> city_dict({"Jacob": ["Bahamas", "Brazil", "Chile"], "Lexi": ["Colombia", "Finland", "Panama"], "Emily": ["Ireland", "Russia", "Kenya", "Jordan"]}) {'Jacob': ['Chile', 'Brazil', 'Bahamas'], 'Lexi': ['Colombia', 'Panama', 'Finland'], 'Emily': ['Kenya',…
Write a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…
Fill-In Blanks of the following question: At the end of every iteration of gets at the end of the list. Answer: sort the heaviest element
Collapse positive integer intervals def collapse_intervals(items): This function is the inverse of the previous problem of expanding positive integer intervals. Given a nonempty list of positive integer items guaranteed to be in sorted ascending order, create and return the unique description string where every maximal sublist of consecutive integers has been condensed to the notation first-last. Such encoding doesn’t actually save any characters when first and last differ by only one. However, it is usually more important for the encoding to be uniform than to be pretty. As a general principle, uniform and consistent encoding of data allows the processing of that data to also be uniform in the tools down the line. If some maximal sublist consists of a single integer, it must be included in the result string all by itself without the minus sign separating it from the now redundant last number. Make sure that the string returned by your function does not contain any whitespace…
6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?
Complete the following function that creates a duplicate version of a list but with the elements stored in reverse order from the original. 1 def reverseOrder (origValues): newValues = [] 1234567 # Add the elements from the origValues List to newValues, in reverse order. # Your code goes here return newValues