In c++, using linear search in reprint function
#include
#include
using namespace std;
void fillArray(int[]);
void printArray(int[]);
void reprint(int[]);
int main()
{
srand(time(0));
int A[10];
fillArray(A);
cout << "A : ";
printArray(A);
cout << "B : ";
}
void fillArray(int D[])
{
int num;
for (int i = 0; i < 10; i++)
{
bool unique;
do {
unique = true;
num = rand() % (99);
for (int j = 0; j < 10; j++)
{
if (D[j] == num)
{
unique = false;
break;
}
}
} while (!unique);
D[i] = num;
}
}
void printArray(int D[])
{
for (int i = 0; i < 10; i++)
{
cout << D[i] << " ";
}
cout << endl;
}
void reprint(int D[])
{
}
Array A should have 10 distinct random integers from 0 to 99 . Use array A to fill array B as
follows..
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
In Java Please CSC 191 Lab 8 - Recursion with Strings Due Date.pdf
1. In Java Please CSC 191 Lab 8 - Recursion with Strings Due Date: 3/22/2023 Write and
implement the following recursive methods: 1. boolean isDup1icate(String s ): check if the 2nd
half of s is a copy of the 1st half. For example, return true for s= "abcabc" or s= "abcdabc", and
return false for s= "abcdef". 2. int evalAS1(String e): evaluate expression e consisting of only
single-digit operands and,+ - operators. An example of a valid expression e would be 5+6-3,
which should return 8 . 3. int indexof(String s1, String s2 ): find the position of s2 on s1. Return
the leftmost location if s2 appears multiple times on s1, and return -1 if s2 is not found on s1.
You are not allowed to use built-in methods . indexof() or . Tastindexof() here. Your main
program should use an appropriate menu to test the methods above. Name your file
FirstnameLastnameLab8.java. Additional Assignment Requirements 1. Your methods must use
recursion.
