. Write a Scheme program for each of the following. Which takes in two lists “lst1” and “lst2”, b...
. Write a Scheme program for each of the following.
Which takes in two lists “lst1” and “lst2”, both of which are individually sorted (in ascending order), and returns a list containing the elements of both lst1 and lst2 in sorted order. Print the final list. Input to the program are “lst1” and “lst2”. For instance,
lst1 = (1 3 5 7) and lst2 = (2 4 6 8)
output: (1 2 3 4 5 6 7 8)
Homework Answers
`Hey,
Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries
(define (merge lst1 lst2)
(cond ((null? lst1) lst2)
((null? lst2) lst1)
((>= (car lst1) (car lst2))
(cons (car lst2) (merge lst1 (cdr lst2))))
(else
(cons (car lst1) (merge (cdr lst1) lst2)))))
(merge '(1 3 5 7) '(2 4 6 8))
Kindly revert for any queries
Thanks.
Add Answer to:
. Write a Scheme program for each of the following. Which takes in two lists “lst1” and “lst2”, b...
Python help: Given the lists, lst1 and lst2, create a new sorted list consisting of all...
Python help: Given the lists, lst1 and lst2, create a new sorted list consisting of all the elements of lst1 that also appears in lst2. For example, if lst1 is [4, 3, 2, 6, 2] and lst2 is [1, 2, 4], then the new list would be [2, 2, 4]. Note that duplicate elements in lst1 that appear in lst2 are also duplicated in the new list. Associate the new list with the variable new_list, and don't forget to sort...
Lists for Python Language
Given the lists, lst1 and lst2 , create a new sorted list consisting of all the elements of lst1 that also appears in lst2 . For example, if lst1 is [4, 3, 2, 6, 2]and lst2 is [1, 2, 4], then the new list would be [2, 2, 4]. Note that duplicate elements in lst1 that appear in lst2 are also duplicated in the new list. Associatethe new list with the variable new_list , and don't forget to sort the...
Define a function called max_association(), which recieves 2 lists, lst1, which is a list of strings,...
Define a function called max_association(), which recieves 2 lists, lst1, which is a list of strings, and lst2, which is a list of integers. The function must return a list of strings associated to the highest integers in lst1. Assume both lists have the same length As an example, the following code fragment: L1 = ['a','b','c','d','e','f','g','h','i','j'] L2 = [1,2,3,1,3,2,3,1,2,1] result = max_association(L1,L2) print(result) should produce the output: ['c', 'e', 'g']
Write a program in scheme using eopl language. Define a function "symbol-count" which takes a flat...
Write a program in scheme using eopl language. Define a function "symbol-count" which takes a flat list of symbols and returns a list of lists in which each symbol is paired with the count of how many times it occurs in the original input. > (symbol-count '(b a)) '((b 1) (a 1))
PYTHON Define a function reverseNestedList(...) which receives one possibly nested list (lst1) and returns the reverse...
PYTHON Define a function reverseNestedList(...) which receives one possibly nested list (lst1) and returns the reverse of both the given list and any nested lists inside it. Note that the testing inputs will not include lists that are nested more than twice (a list in a list in a list ++...) [[[...],1], 1] Good luck! As an example, the following code fragment: lst1 = [[1, 2], [3, 4]] print(reverseNestedList(lst1)) should produce the output: [[4, 3], [2, 1]]
IN PYTHON: Write a function that takes, as arguments, two lists, one of which is a...
IN PYTHON: Write a function that takes, as arguments, two lists, one of which is a character list and the other is the corresponding frequencies, and sorts the characters in ascending order of frequencies. The function should return a list consististing of two lists: the first list is the list of characters and the second is the list of corresponding frequencies, consistent with the rearranged characters. Name this function sortCharacters(characterList, frequencyList). For example, >>>sortCharacters(["a", "b", "c", "d"], [5, 8, 3,...
ANSWER USING PYTHON Write a recursive function that takes 2 sorted lists as arguments and returns...
ANSWER USING PYTHON Write a recursive function that takes 2 sorted lists as arguments and returns a single, merged sorted list as a result. For example, if the two input lists are [0, 2, 4, 6, 8] and [1, 3, 5, 7, 9], the returned result should be [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]. Remember that you can add lists in Python using the + operator ([0] + [1,2,3] = [0,1,2,3]) and can take slices of...
please help with python Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection...
please help with python
Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 4 6 Initial List Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List...
Write a mips program that defines two integer array that are pre-sorted and the same size...
Write a mips program that defines two integer array that are pre-sorted and the same size (e.g., [3, 7, 9, 11, 15, 21] and [1, 4, 6, 14, 18, 19]) and a function merge that takes the two arrays (and their size) as inputs and populates a single array of twice the size of either input array that contains the elements of both arrays in ascending order. In the example arrays given, then output would be [1, 3, 4, 6,...
Question 5 (10 Points) Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection-Sort...
Question 5 (10 Points) Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection-Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 Initial List 4 6 18 4 6 Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position:...
please help with python
Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 4 6 Initial List Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List...
Question 5 (10 Points) Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection-Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 Initial List 4 6 18 4 6 Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position:...
Most questions answered within 3 hours.
-
Amazon is not just a
surviving company of the 1990s tech boom; it is now one...
asked 15 seconds ago -
You are the CEO of a major corporation whose databases were
recently hacked, and sensitive customer...
asked 2 minutes ago -
Q1b. Provide an example of how pricing should interact
with the services offered by the retailer.
asked 28 minutes ago -
a mass weighing 8 pounds when attached to a spring, stretches
it 6 inches.the object is...
asked 35 minutes ago -
The following is part of the computer output from a regression
of monthly returns on Waterworks...
asked 40 minutes ago -
Bob Katz is purchasing a new Honda Pilot for $35,000. He is
financing $30,000 with a...
asked 43 minutes ago -
The equity holders of Super Nova, Inc. have 100 million of
equity in the firm. Because...
asked 42 minutes ago -
A sample of 240 observations is selected from a normal
population with a population standard deviation...
asked 59 minutes ago -
Write an (efficient) pseudocode for the implementation of each
of the following function prototypes (proper C...
asked 58 minutes ago -
Klingon Widgets, Inc., purchased new cloaking machinery three
years ago for $5.6 million. The machinery can...
asked 1 hour ago -
Social work's goal of social betterment implies
A. That social workers should be models of good...
asked 59 minutes ago -
a
12 kg box sits on a horizontal table. a string with tension 30.4 N
pulls...
asked 1 hour ago