TheAlgorithms/C++ 1.0.0
All the algorithms implemented in C++
|
Implementation for the Array Left Rotation algorithm. More...
#include <cassert>
#include <iostream>
#include <vector>
Go to the source code of this file.
Namespaces | |
namespace | operations_on_datastructures |
for std::vector | |
namespace | tests |
Testcases to check Union of Two Arrays. | |
Functions | |
void | operations_on_datastructures::print (const std::vector< int32_t > &array) |
Prints the values of a vector sequentially, ending with a newline character. | |
std::vector< int32_t > | operations_on_datastructures::shift_left (const std::vector< int32_t > &array, size_t shift) |
Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated. | |
void | tests::test1 () |
A Test to check an simple case. | |
void | tests::test2 () |
A Test to check an empty vector. | |
void | tests::test3 () |
A Test to check an invalid shift value. | |
void | tests::test4 () |
A Test to check a very large input. | |
void | tests::test5 () |
A Test to check a shift of zero. | |
static void | test () |
Function to test the correctness of shift_left() function. | |
int | main () |
main function | |
Implementation for the Array Left Rotation algorithm.
Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input.
Definition in file array_left_rotation.cpp.
int main | ( | void | ) |
main function
Definition at line 171 of file array_left_rotation.cpp.
|
static |
Function to test the correctness of shift_left() function.
Definition at line 159 of file array_left_rotation.cpp.