//TO DO **************************************
//Write your name

#include <iostream>
#include <string>
using namespace std;



/* Write a function IsOdd such that
input: an int
output: boolean
function: Return true if the number is an odd number and return false otherwise
HINT: Odd numbers are not divisible to 2. Therefore, the remainder
after dividing the an odd number by 2 should be 1.
Hint: % is used for the modulus operation. n%m gives you the remainder after dividing n by m.
for example 7%2 = 1 because 7 = 2 *3 + 1;
*/
//TO DO **************************************






/* Write a function findOdd such that
input: an int array, and the size of the array
output: nothing
function: Display the odd numbers of the array
*/
//TO DO **************************************







//Write the function called sumOdds in the given interval such that
// output : integer
// input : an array of int, the starting index of search, the ending point of searchspace
// function: Sum the odd numbers in the given interval
//

//****************To Do********************
int sumOdds(int array[], int start, int end){


}






int main()
{
	/* The output of this section should be
	The prime numbers are : 55, 7, 11
	*/
	int A[5] = { 2, 55, 7, 44, 11 };
	cout << "The output should be 55,7,11, your output is ";
	findOdd(A, 5);




	//Testing sumOdss
	// output should be : 80
	int B[13] = {20, 3, 41, 7, 8, 10, 12, 23, 200, 2, 9, 10, 91}; 
	cout << "The summation of odd numbers in the given interval is 18, your answer is "<<sumOdds(B, 2, 10) << endl;

	return 0;
}