Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define SIZE 6
- using namespace std;
- int findMin(int *arr, int size)
- {
- int index = 0;
- int min = arr[0];
- for(int i = 0; i < size; i++)
- if (arr[i] < min)
- {
- min = arr[i];
- index = i;
- }
- return index;
- }
- int findMax(int *arr, int size)
- {
- int index = 0;
- int max = 0;
- for(int i = 0; i < size; i++)
- if (arr[i] > max)
- {
- index = i;
- max = arr[i];
- }
- return index;
- }
- int main()
- {
- int arr[SIZE] = { 4, 10, 200, 3, 5, 1 };
- int min = findMin(arr, SIZE);
- int max = findMax(arr, SIZE);
- if (min < max)
- {
- for (int i = min; i < max; i++)
- {
- for (int j = min; j < max; j++)
- {
- if (arr[j] < arr[i])
- swap(arr[j], arr[i]);
- }
- }
- }
- else if (min > max)
- {
- for (int i = max; i < min; i++)
- {
- for (int j = max; j < min; j++)
- {
- if (arr[j] < arr[i])
- swap(arr[j], arr[i]);
- }
- }
- }
- for (int i = 0; i < SIZE; i++)
- cout << arr[i] << " ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement