Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <ctime>
- enum idx{first,last};
- void randomizeArr(int arr[], int arrSize, int minVal, int maxVal)
- {
- for (int i{ 0 }; i < arrSize; ++i)
- {
- arr[i] = rand() % (maxVal - minVal) + minVal;
- }
- }
- void printArr(int arr[], int arrSize )
- {
- for (int i{ 0 }; i < arrSize; ++i)
- {
- std::cout << arr[i] << ' ';
- }
- std::cout << '\n';
- }
- void findNegatives(int arr[], int arrSize, int arrRes[])
- {
- arrRes[idx::first] = -1;
- arrRes[idx::last] = -1;
- bool found{false};
- for (int i{ 0 }; i < arrSize; ++i)
- {
- if (arr[i] < 0)
- {
- if (found)
- {
- arrRes[idx::last] = i;
- }
- else
- {
- arrRes[idx::first] = i;
- arrRes[idx::last] = i;
- found = true;
- }
- }
- }
- }
- void sortArr(int arr[], int arrSize, int begin, int end)
- {
- int tmp{ 0 };
- for (int head{ begin + 1 }; head < end; ++head)
- {
- for (int tail{ end - 1 }; tail > head; --tail)
- {
- if (arr[tail] < arr[tail - 1])
- {
- tmp = arr[tail - 1];
- arr[tail - 1] = arr[tail];
- arr[tail] = tmp;
- }
- }
- }
- }
- int main()
- {
- srand(time(0));
- const int minVal{ -20 };
- const int maxVal{ 20 };
- const int arrSize{ 10 };
- const int arrResSize{2};
- int arr[arrSize];
- int arrRes[arrResSize];
- randomizeArr(arr,arrSize, minVal, maxVal);
- std::cout << "Original array: ";
- printArr(arr, arrSize);
- findNegatives(arr, arrSize, arrRes);
- std::cout << "First negative element: " << arr[arrRes[idx::first]] << '\n'
- << "Last negative element: " << arr[arrRes[idx::last]] << "\n";
- sortArr(arr, arrSize, arrRes[idx::first], arrRes[idx::last]);
- std::cout << "Sorted array: ";
- printArr(arr, arrSize);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement