Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <cstdlib>
- #include <cmath>
- using namespace std;
- int coubSumRecurs(int *inArr, size_t size);
- //size_t minModNumberRecurs(int *inArr, size_t size, int min = 2147483647, size_t minNumb = 0);
- size_t minModNumberRecurs(int *inArr, size_t size, int min = 2147483647, size_t minNumb = 0) {
- if (!size)
- return minNumb;
- if (abs(inArr[size - 1]) > min) {
- min = inArr[size - 1];
- minNumb = size - 1;
- }
- return minModNumberRecurs(inArr, size - 1, min, minNumb);
- }
- int main()
- {
- int mas1[] = { 32, 1, -1, 5, 3 };
- int mas2[] = { 213, 44, 41, 0, 11 };
- cout << (minModNumberRecurs(mas1, 5)) << endl;
- cout << (minModNumberRecurs(mas2, 5)) << endl;
- setlocale(0, "");
- if (
- (coubSumRecurs(mas1, 4) == -480) && (coubSumRecurs(mas2, 4) == 0)
- &&
- (minModNumberRecurs(mas1, 5) == 2) && (minModNumberRecurs(mas2, 5) == 3)
- )
- cout << "Программа работает..." << endl;
- else
- cout << "Программа не работает :(" << endl;
- return 0;
- }
- int coubSumRecurs(int *inArr, size_t size) {
- if (!size)
- return *inArr;
- return inArr[size] * coubSumRecurs(inArr, size - 1);
- }
- /*size_t minModNumberRecurs(int *inArr, size_t size, int min, size_t minNumb) {
- if (!size)
- return minNumb;
- if (abs(inArr[size - 1]) > min) {
- min = inArr[size - 1];
- minNumb = size - 1;
- }
- return minModNumberRecurs(inArr, size - 1, min, minNumb);
- }*/
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement