Write the following array functions. Use integer arrays. Suppose, arr[] = {1, 4, 6, 5, 2, 7, 10} a. Search for a given value in the array and return the index of the location. Return -1 if not found in the array. void search (int arr[], int n, int val); Using the above array arr, search (arr, 7, 6) should return 2, and search (arr, 7, 8) should return -1. Reverse the contor

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
Hello, I am having trouble solving this problem for my c++ class. I still haven’t really understood how to create functions using void. This problem unfortunately requires our code to use the pieces of code given. So I have to use a void function. If I could get a solution w soma steps that would be nice thank you
8 q1.cpp* X
ssn 8 q1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
1578
6%
(Global Scope)
main()
//assn 8 q1.cpp: This file contains the 'main' function: Program execution
#include <iostream>
void search(int [], int n, int val);
const int size = 7;
Bint main()
{
5.2
int arr[size] = { 1, 4, 6, 5, 2, 7, 10 };
if (arr[] == -1)
cout << cbcb;
else
void search(int list[], int n, int val)
{
int index = 0;
int position = -1;
bool found = false;
while (index <n && !found) {
if (list[index] == val) {
found = true;
position index;
index++;
0
Debug
个
W
Ln: 13
Ch: 14
Transcribed Image Text:8 q1.cpp* X ssn 8 q1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 1578 6% (Global Scope) main() //assn 8 q1.cpp: This file contains the 'main' function: Program execution #include <iostream> void search(int [], int n, int val); const int size = 7; Bint main() { 5.2 int arr[size] = { 1, 4, 6, 5, 2, 7, 10 }; if (arr[] == -1) cout << cbcb; else void search(int list[], int n, int val) { int index = 0; int position = -1; bool found = false; while (index <n && !found) { if (list[index] == val) { found = true; position index; index++; 0 Debug 个 W Ln: 13 Ch: 14
erences Mailings Review View Help
can contain viruses. Unless you need to edit, it's safer to stay in Protected View.
Write the following array functions. Use integer arrays.
Suppose, arr[] = {1, 4, 6, 5, 2, 7, 10}
f4
$
2. Matrix Calculator
Q Search
a. Search for a given value in the array and return the index of the location. Return -1 if
not found in the array.
void search (int arr[], int n, int val);
Using the above array arr, search (arr, 7, 6) should return 2, and
search (arr, 7, 8) should return -1.
b. Reverse the contents of the array.
void reverse (int arr[], int n) ;
Using the above array arr, reverse (arr, 7) should return result in arr
contents rearranged as follows: arr = {10, 7, 2, 5, 6, 4, 1}
c. Rearrange the array such that all the odd elements in the array are in the beginning of
the array.
void oddFirst (int arr [], int n);
Using the above array arr, oddFirst (arr, 7) should return result in arr
contents rearranged as follows: arr = {1, 5, 7, 4, 6, 2, 10}
f5
Assignment 8 (Protected View) - Word
%
5
Thi
f6
A
Tell me what you want to do
f789
&
7
Enable Editing
19
for
X
f10
O
f11 of
f12/
Transcribed Image Text:erences Mailings Review View Help can contain viruses. Unless you need to edit, it's safer to stay in Protected View. Write the following array functions. Use integer arrays. Suppose, arr[] = {1, 4, 6, 5, 2, 7, 10} f4 $ 2. Matrix Calculator Q Search a. Search for a given value in the array and return the index of the location. Return -1 if not found in the array. void search (int arr[], int n, int val); Using the above array arr, search (arr, 7, 6) should return 2, and search (arr, 7, 8) should return -1. b. Reverse the contents of the array. void reverse (int arr[], int n) ; Using the above array arr, reverse (arr, 7) should return result in arr contents rearranged as follows: arr = {10, 7, 2, 5, 6, 4, 1} c. Rearrange the array such that all the odd elements in the array are in the beginning of the array. void oddFirst (int arr [], int n); Using the above array arr, oddFirst (arr, 7) should return result in arr contents rearranged as follows: arr = {1, 5, 7, 4, 6, 2, 10} f5 Assignment 8 (Protected View) - Word % 5 Thi f6 A Tell me what you want to do f789 & 7 Enable Editing 19 for X f10 O f11 of f12/
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Array
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
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