int n, int s) { int find (int *v, int 1, j; for (i-0; i

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
icon
Related questions
Question
Please solve asap and answer based on the format the question asked for please.
Given the following function
int find (int *v, int n, int s) {
int 1, j;
for (i=0; i<n-4; i++) {
int sum =
for (j-0; j<4; j++) {
sum + v[i+jl;
if (sum
s)
return i;
return -1;
Answer the following questions:
A) Which is the worst-case complexity of the function? T(n) = 0...) Why?
B) The function searches in a vector an interval of consecutive elements with a
certain characteristic: which one?
C) Suppose that the input vector contains more than one interval that fulfils the
criterium of point B, which one will be returned: the first one, the last one or a
random one?
D) Suppose that there exists a vector int data[N], with N constant. Are the following
function calls correct? Why? (Say yes/no per each of the options, and explain why)
1) nd3 find(data,N,8);
2) nd= find(&data[0],N,N);
3) nd3 find(*data,N,8);
4) nd3 find(data+N/2,N,N);
Transcribed Image Text:Given the following function int find (int *v, int n, int s) { int 1, j; for (i=0; i<n-4; i++) { int sum = for (j-0; j<4; j++) { sum + v[i+jl; if (sum s) return i; return -1; Answer the following questions: A) Which is the worst-case complexity of the function? T(n) = 0...) Why? B) The function searches in a vector an interval of consecutive elements with a certain characteristic: which one? C) Suppose that the input vector contains more than one interval that fulfils the criterium of point B, which one will be returned: the first one, the last one or a random one? D) Suppose that there exists a vector int data[N], with N constant. Are the following function calls correct? Why? (Say yes/no per each of the options, and explain why) 1) nd3 find(data,N,8); 2) nd= find(&data[0],N,N); 3) nd3 find(*data,N,8); 4) nd3 find(data+N/2,N,N);
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Asymptotic Analysis
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education