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
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
Question
C++
![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 <cstddef> // size t
2
int* rotateleft(int a[], size_t len)
{
3
4
5
6
7
8
return a;
}
Tester.cpp
1
#include <iostream>
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
6.
7
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F930dba79-0d29-4e51-b7ee-c49d28417990%2F8eedcee2-0d73-4426-9d55-237d30281386%2Fyw55bs5_processed.png&w=3840&q=75)
Transcribed Image Text: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 <cstddef> // size t
2
int* rotateleft(int a[], size_t len)
{
3
4
5
6
7
8
return a;
}
Tester.cpp
1
#include <iostream>
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
6.
7
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
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education