Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include int last0f(const int a[], int aLen, const int b[], int bLen) { int pos = -1; for (size t i = 0; i < aLen; ++i) if (a[i] == pos) pos = i; return pos; 3 4 7 8 9. 10 11 } CodeCheck Reset Testers Running Tester.cpp fail pass fail fail fail al->[3, 2, 11, 10, 1] b1->[8, 10, 6] last0f (al, 5, b1, 3): -1 Expected: 3 al->[3, 2, 11, 10, 1] b2->[5, 6] lastof (al, 5, b2, 2): -1 Expected: -1 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b2->[5, 6] last0f (a2, 11, b2, 2): -1 Expected: 6 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b1->[8, 10, 6] last0f (a2, 11, b1, 3): -1 Expected: 10 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b3->[11, 2, 1, 15] last0f(a2, 11, b3, 4): -1 Expected: 8 Score 1/5
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include int last0f(const int a[], int aLen, const int b[], int bLen) { int pos = -1; for (size t i = 0; i < aLen; ++i) if (a[i] == pos) pos = i; return pos; 3 4 7 8 9. 10 11 } CodeCheck Reset Testers Running Tester.cpp fail pass fail fail fail al->[3, 2, 11, 10, 1] b1->[8, 10, 6] last0f (al, 5, b1, 3): -1 Expected: 3 al->[3, 2, 11, 10, 1] b2->[5, 6] lastof (al, 5, b2, 2): -1 Expected: -1 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b2->[5, 6] last0f (a2, 11, b2, 2): -1 Expected: 6 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b1->[8, 10, 6] last0f (a2, 11, b1, 3): -1 Expected: 10 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b3->[11, 2, 1, 15] last0f(a2, 11, b3, 4): -1 Expected: 8 Score 1/5
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
C++
![Write the function lastOf which searches the array a for the last occurance of any value contained in
the array b. Returns the index if found. If not found, return -1.
arrays.cpp
1
#include <cstddef>
int lastof(const int a[], int aLen, const int b[], int bLen)
{
int pos = -1;
for (size t i = 0; i < aLen; ++i)
if (a[i]
return pos;
3
4
5
6
7
== pos) pos = i;
8
10
11
}
CodeCheck
Reset
Testers
Running Tester.cpp
fail pass fail fail fail
al->[3, 2, 11, 10, 1]
b1->[8, 10, 6]
last0f (al, 5, b1, 3): -1
Expected: 3
al->[3, 2, 11, 10, 1]
b2->[5, 6]
last0f(al, 5, b2, 2): -1
Expected: -1
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b2->[5, 6]
last0f (a2, 11, b2, 2): -1
Expected: 6
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b1->[8, 10, 6]
lastof (a2, 11, b1, 3): -1
Expected: 10
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b3->[11, 2, 1, 15]
lastof (a2, 11, b3, 4): -1
Expected: 8
Score
1/5](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F930dba79-0d29-4e51-b7ee-c49d28417990%2F3220a57b-c09a-4d7f-ae1b-7d0eddd59666%2Ft4jr5x9_processed.png&w=3840&q=75)
Transcribed Image Text:Write the function lastOf which searches the array a for the last occurance of any value contained in
the array b. Returns the index if found. If not found, return -1.
arrays.cpp
1
#include <cstddef>
int lastof(const int a[], int aLen, const int b[], int bLen)
{
int pos = -1;
for (size t i = 0; i < aLen; ++i)
if (a[i]
return pos;
3
4
5
6
7
== pos) pos = i;
8
10
11
}
CodeCheck
Reset
Testers
Running Tester.cpp
fail pass fail fail fail
al->[3, 2, 11, 10, 1]
b1->[8, 10, 6]
last0f (al, 5, b1, 3): -1
Expected: 3
al->[3, 2, 11, 10, 1]
b2->[5, 6]
last0f(al, 5, b2, 2): -1
Expected: -1
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b2->[5, 6]
last0f (a2, 11, b2, 2): -1
Expected: 6
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b1->[8, 10, 6]
lastof (a2, 11, b1, 3): -1
Expected: 10
а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8]
b3->[11, 2, 1, 15]
lastof (a2, 11, b3, 4): -1
Expected: 8
Score
1/5
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
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