1.1 写一个函数判断是否闰年

#include <iostream>
using namespace std;class Date
{private:int year;int month;int day;public:Date(int y,int m,int d);void SetDate(int y,int m,int d);void Output();bool IsLeapYear();
};Date::Date(int y,int m,int d){this->year=y;this->month=m;this->day=d;
}void Date::SetDate(int y, int m,int d)
{year = y;month = m;day = d;
}void Date::Output()
{cout<<year<<"-"<<month<<"-"<<day<<endl;
}bool Date::IsLeapYear()
{if((year%4==0 && year%100!=0)||year%400==0)return true;return false;
}int main()
{Date d1(2017,3,10);d1.Output();bool b;b=d1.IsLeapYear();if(b){cout<<"是闰年"<<endl;}else{cout<<"不是闰年"<<endl;}
}

1.2 写一个函数判断某数是否素数

#include <iostream>
using namespace std;class Number
{
public://Number(int n);bool IsSuShu(int n);void Output();
};bool Number::IsSuShu(int n)
{int i;for(i=2;i<n;i++)if(n%i==0) return 0;return 1;
}int main()
{int n;cin>>n;Number n1;bool b;b= n1.IsSuShu(n);if(b){cout<<n<<"是素数"<<endl;}else{cout<<n<<"不是素数"<<endl;}return 0;
}

1.3 写一个函数求数组元素的平均值

#include <iostream>
using namespace std;double average(int a[],int n)
{double sum=0.0;int i;for(i=0;i<n;i++){sum += a[i];}return sum/n;
}int main()
{int a[7] = {6,8,10,12,14,16,18};double ave;ave = average(a,7);cout<<"该数组平均数为:"<<endl<<ave<<endl;return 0;
}

1.4 写一个函数求数组中元素的最大值

#include <iostream>
using namespace std;int max(int d[],int n)
{int max=d[0];int i;for(i=0;i<n;i++)if(max<d[i]) max=d[i];return max;
}int main()
{int a[7] = {6,8,10,12,14,16,18};int m;m = max(a,7);cout<<"该数组的最大数为:"<<endl<<m<<endl;return 0;
}

1.5 写一个函数实现对数组的元素进行排序, 输入一个数,要求用折半查找法找出该数是数组中第几个元素， 找不到则返回-1

#include <iostream>
using namespace std;void bubbleSort(int* arr,int length)
{int temp;for(int i = 0;i != length;++i){for (int j = 0; j != length; ++j){if (arr[i] < arr[j]){temp = arr[i];arr[i] = arr[j];arr[j] = temp;}}}
}int BinarySearch(int *array, int aSize, int key)
{if ( array == NULL || aSize == 0 )return -1;int low = 0;int high = aSize - 1;int mid = 0;while ( low <= high ){mid = (low + high )/2;if ( array[mid] < key)low = mid + 1;else if ( array[mid] > key )high = mid - 1;elsereturn mid;}return -1;
}
int main()
{int key;cin>>key;int a[7] = {6,8,10,12,14,16,18};bubbleSort(a,7);cout<<"position:"<<BinarySearch(a,7,key)<<endl;return 0;
}