Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, • (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, • (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

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

Solve this problem in java programming
Complete question bcoding:-.
Write a sort function that uses the bubble-sort algorithm. The bubble-sort algorithm makes several passes through the list. On each pass, successive neighboring pairs are compared. If a pair is in decreasing order, its values are swapped; otherwise, the values remain unchanged. The technique is called a bubble sort or sinking sort because the smaller values gradually “bubble” their way to the top and the larger values “sink” to the bottom. Write a test program that reads in ten numbers, invokes the function, and displays the sorted numbers.
Write a function myJoin(lst, glue) in JavaScript that takes a "glue" string and a list of strings and uses Array#reduce to return a single string that contains all the elements in lst joined by the "glue" string. You must use Array#reduce do the vast majority of the work. (You may do a little pre- and post- processing outside the call to reduce.) The lambda passed to Array#reduce function has parameters in this order: partial, item. When working on this question, you may visit this page containing the documentation for the Array class. You may assume that lst is not empty. For example, myJoin(["Arizona", "Nevada"], ",") should return "Arizona, Nevada" myJoin(["GVSU", "Ferris", "Michigan Tech"], "--") should return "GVSU -- Ferris -- Michigan Tech"
Write keyword-counting program with the definition of keytab. Themain routine reads the input by repeatedly calling a function getword thatfetches one word at a time. Each word is looked up in keytab with a versionof the binary search function. The list of keywords must be sorted in increasing order in the table.
Write a function REMOVE-NUM that takes a list and returns a list consisting of the original list with all numeric atoms removed. Examples: (REMOVE-NUM '(2 A 6 B 1 C 7 D)) returns the list (A B C D) (REMOVE-NUM '(3 A 4 B (1 E) 7 D)) returns the list (A B (E) D)
Write a program in Python including the following functions: Write a function that takes a list and 2 integers x and y as parameter and performs the following: • if the list has an even number of elements, inserts y number of x's in the middle of the list. þtherwise, inserts y number of x's to the end of the list • Returns the list. Sample Run: 1st=[2,3,4,5] 1st=fun (1st,9,2) [2, 3, 9, 9, 4, 5] You can use list functions, but no loops and no type conversion. Recursion is allowed.
Implement the following function. Hint: You should use a dictionary. def word_pattern (pattern: str, words: List [str]) -> bool: I ''Given a pattern and a word list, determine if the word list follows the same pattern. That is to say, ensure that pattern [j] pattern [k] only when words [j] == words [k] pattern [j] = pattern [k] means words [j] != words [k] Precondition: Assume pattern is all lowercase letters. >>> word_pattern ('aaaa', ['cat', 'cat', 'cat', 'cat']) True and == >>> word_pattern ('yoox', ['dog', 'cat', 'cat', 'fish']) True >>> word_pattern ('xy', ['cat', 'cat']) False >>> word_pattern('xoox', ['dog', 'cat', 'cat', 'fish']) False
This is to be done in ML programming language. Please use the simplest code possible, nothing too advanced. Define a function rem_duplicate: ''a list -> ''a list whichtakes in input a list and removes all the duplicates. Test your code with sampleinput and report result. Examples: rem_duplicate [] = [] rem_duplicate [1,2,1] = [1,2] rem_duplicate ["a","a","a"] = ["a"] rem_duplicate [[1],[1,2],[1,2,3],[1,2],[4,5]] = [[1],[1,2],[1,2,3],[4,5]]
Write a function find_max_tuple() that gets a list of tuples as parameter, finds and returns the tuple with maximum sum inside the list. Write Python statements that create a sample list that has tuples inside (you can use the list of tuples in the sample run below), then use find_max_tuple() function to get the tuple with maximum sum and print it. Sample tuples=[(3,4,360,6),(1,2),(12,),(132,244,64),(72,71,70)] The maximum tuple is (132,244,64)
Write a function print_matching_indexes (items, target) that prints the indexes of all the occurrences of the target in the list items. Check the test cases for how the function should work. Note: Your answer must use a for loop. You are not allowed to use a while loop. For example: Test Result nums = [10, 20, 30] 1 print_matching_indexes (nums, 20) pets = ['dog', 'cat', 'fish', 'cat', 'dog', 'iguana'] 1 print_matching_indexes (pets, 'cat') 3 empty = [] print_matching_indexes (empty, 42)
JAVA Problem Create a function that determines whether elements in an array can be re-arranged to form a consecutive list of numbers where each number appears exactly once. Examples cons([5, 1, 4, 3, 2]) → true // Can be re-arranged to form [1, 2, 3, 4, 5] cons([5, 1, 4, 3, 2, 8]) → false cons([5, 6, 7, 8, 9, 9]) → false //9 appears twice