Answered: Insert and merge: Write a function…

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

Related questions

Question

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)

1 # let 1st=["avocado",3; "banana",2; "pear",6; "potato"
, 10] ; ;
2 # insert_and_merge lst ("banana",6) ; ;
3
(string * int) list
-
=
[("avocado", 3); ("banana",
8); ("pear", 6); ("potato", 10)]
4 # insert_and_merge 1st ("zuccini", -2) ;;
(string * int) list = [("avocado", 3); ("banana",
2); ("pear", 6); ("potato", 10); ("zuccini", -2)]
6 # insert_and_merge 1st ("apple",1) ; ;
7 -
(string * int) list
[("apple", 1); ("avocado",
3); ("banana", 2); ("pear", 6); ("potato", 10)]
=

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions