Discrete Mathematics: Algorithms. Look at the image attached below and answer the questions.
Discrete Mathematics: Algorithms. Look at the image attached below and answer the questions.
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
Related questions
Question
Discrete Mathematics:
![Consider the algorithm below.
procedure find sums ( [a1, a2,
a,]: a list of integers, s:
an integer)
1
locations := (}
for i := 1 to n-1
for j := i+1 to n
if a + a; = s
locations := locations U {(i,j)}
return locations
a. List the steps used to evaluate find_sums ([2, 4, 6, 8], 10).What set is returned?
b. Find a function f(n) that counts the number of times the highlighted addition (in line 4) is evaluated when
the algorithm is performed on a list of length n.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3079c1ef-2e8c-48d9-865a-469cd1474f9a%2F244a355c-6639-4eb6-b583-d5964b3003d8%2Fhdmsljq_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the algorithm below.
procedure find sums ( [a1, a2,
a,]: a list of integers, s:
an integer)
1
locations := (}
for i := 1 to n-1
for j := i+1 to n
if a + a; = s
locations := locations U {(i,j)}
return locations
a. List the steps used to evaluate find_sums ([2, 4, 6, 8], 10).What set is returned?
b. Find a function f(n) that counts the number of times the highlighted addition (in line 4) is evaluated when
the algorithm is performed on a list of length n.
Expert Solution

Step 1
Given :- (a.)List the steps used to evaluate find sums ( [2, 4, 6, 8], 10) . What set is returned?
(b.) Find a function f (n) that counts the number of times the highlighted addition (in line 4) is evaluated when
the algorithm is performed on a list of length n.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps

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.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education