Write the function rotateLeft which shifts each element in the array left by one position, moving the first element to the end. Return the modified array. arrays.cpp 1 #include // size t 2 3 int* rotateleft(int a[], size t len) { 4 6. return a; 9. } Tester.cpp 1 #include 2 using namespace std; 3 #include "arrays.h" int main() { int al[] = {10,13,14,10,10,8}; auto len1 = sizeof(al) / sizeof(al[0]); print ("before al->", al, len1); print("after al: ", rotateLeft(al, len1), len1); cout « "Expected: [13, 14, 10, 10, 8, 10]" « endl; cout « endl; 4 5 7 8 9. 10 11 12 13 int a2[] = {3,9,9,5}; auto len2 = sizeof(a2) / sizeof(a2[0]); print("before a2->", a2, len2); print("after a2: ", rotateLeft(a2, len2), len2); cout « "Expected: [9, 9, 5, 3]" « endl; } 14 15 16 17 18 19 CodeCheck Reset

Write the function rotateLeft which shifts each element in the array left by one position, moving the first element to the end. Return the modified array. arrays.cpp 1 #include // size t 2 3 int* rotateleft(int a[], size t len) { 4 6. return a; 9. } Tester.cpp 1 #include 2 using namespace std; 3 #include "arrays.h" int main() { int al[] = {10,13,14,10,10,8}; auto len1 = sizeof(al) / sizeof(al[0]); print ("before al->", al, len1); print("after al: ", rotateLeft(al, len1), len1); cout « "Expected: [13, 14, 10, 10, 8, 10]" « endl; cout « endl; 4 5 7 8 9. 10 11 12 13 int a2[] = {3,9,9,5}; auto len2 = sizeof(a2) / sizeof(a2[0]); print("before a2->", a2, len2); print("after a2: ", rotateLeft(a2, len2), len2); cout « "Expected: [9, 9, 5, 3]" « endl; } 14 15 16 17 18 19 CodeCheck Reset

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Write the function that returns the total number of the searched value according to the 1000 sized integer array (all the numbers should be generated between 0 to 100) sent into it and array length, on an array withinitial values.
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
2) Complete the below code by making the reuse of the existing functionality. Find the index of the equilibrium element in the given array. In an array equilibrium element is the one where the sum of all the elements to the left side is equal to the sum of all the elements on the right side. Return Value: 1) Return -1 if no equilibrium element is found 2) In case there is more than one equilibrium element, return the element with the least index value. You are supposed to complete the given code by reusing the existing function. You can click on Compile & run anytime to check the compilation/execution status of the program you can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all the test cases. Code approach For the question: Correct the given implementation. Do not modify the approach. Test Case: a[] = {1,2,3,4,3,3}. 4 is the equilibrium element since its left side sum (1+2+3) is equal to its right side sum…
Write a code segment that initializes each cell in a three-dimensional array with an integer that represents its three index positions. Thus, if a position is (depth, row, column), the integer datum at position (2, 3, 3) is 233.
this is insturction Write a program which prompts the user to enter up to 15 floating point numbers (terminated with a non-numeric), reads them into an array, then prints the following. The program must use an array (not a vector) to get credit. The array values in the original order, separated by commas, with no trailing comma at the last value. The array values where the order of each adjacent pair of elements is swapped, separated by commas (NOT every element swapped with its next neighbor, which would just move the first element to the end, but every original pair swapped only in that pair. For an odd element count, the last element should not change. See examples below.) The smallest number in the array. Example program outputs with user input shown in bold font: Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 # Original array: 1, 0, -1.001 The swapped array: 0, 1, -1.001 Smallest number: -1.001 Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 5 ,…
A three-dimensional array called watermelon is declared as based on the row-wise manner as below: int watermelon [3][2][2]= {9, 7, 1, 5, 9, 7, 1, 5, 9, 7 ,1, 5}; Rewrite the sequence of watermelon array if it is accessed in column wise manner. Select one: A.9 9 9 7 7 7 1 1 1 5 5 5 B.9 7 1 5 9 9 7 7 1 1 5 5 C.5 1 7 9 5 1 7 9 5 1 7 9 D.9 7 1 5 9 7 1 5 9 7 1 5
Write a program that uses random number generation to create sentences.The program should use four arrays of pointers to char called article, noun, verband preposition. The program should create a sentence by selecting a word atrandom from each array in the following order: article, noun, verb, preposition,article and noun. As each word is picked, it should be concatenated to the previouswords in an array large enough to hold the entire sentence.The words should be separated by spaces. When the final sentence is output, itshould start with a capital letter and end with a period. The program shouldgenerate 20 such sentences. The arrays should be filled as follows: The article arrayshould contain the articles "the", "a", "one", "some “and "any"; the noun arrayshould contain the nouns "boy", "girl", "dog", "town" and "car"; the verb arrayshould contain the verbs "drove", "jumped", "ran", "walked" and "skipped"; thepreposition array should contain the prepositions "to", "from", "over",…
Program in C language Write and execute the following code to create a 1-dimensional int array. #include <stdio.h> int main() { int arr[]={10,20,30,40,50}; int n; n=sizeof(arr)/sizeof(int); printf("Number of elemenets are: %d\n",n); return 0; }
Write a program that asks the user to type 10 integers of an array and an integer value V. The program must search if the value V exists in the array and must remove the first occurrence of V, shifting each following element left and adding a zero at the end of the array. The program must then write the final array.
Create a function that returns the majority vote in an array. A majority vote is an element that occurs > N/2 times in an array (where N is the length of the array).
1 Write a program which prompts the user to enter up to 15 floating point numbers (terminated with a non-numeric), reads them into an array, then prints the following. The program must use an array (not a vector) to get credit. The array values in the original order, separated by commas, with no trailing comma at the last value. The array values where the order of each adjacent pair of elements is swapped, separated by commas (NOT every element swapped with its next neighbor, which would just move the first element to the end, but every original pair swapped only in that pair. For an odd element count, the last element should not change. See examples below.) The smallest number in the array. Example program outputs with user input shown in bold font: Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 # Original array: 1, 0, -1.001 The swapped array: 0, 1, -1.001 Smallest number: -1.001 Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 5 , Original array: 1, 0,…
/*Code: Construct BST From Sorted ArraySend FeedbackGiven a sorted integer array A of size n, which contains all unique elements. You need to construct a balanced BST from this input array. Return the root of constructed BST.Note: If array size is even, take first mid as root.Input format:The first line of input contains an integer, which denotes the value of n. The following line contains n space separated integers, that denote the values of array.Output Format:The first and only line of output contains values of BST nodes, printed in pre order traversal.Constraints:Time Limit: 1 secondSample Input 1:71 2 3 4 5 6 7Sample Output 1:4 2 1 3 6 5 7 */public class SortedArrayToBst { /* Binary Tree Node class * * class BinaryTreeNode<T> { T data; BinaryTreeNode<T> left; BinaryTreeNode<T> right; public BinaryTreeNode(T data) { this.data = data; } } */…