头文件 my_func.h
#ifndef _MY_FUNC_H_
#define _MY_FUNC_H_
int D_isLeapYear(int year);
int D_isPrimenum(int num);
double D_computeArea(double r);
void D_swap(int* a, int* b);
int D_bubbleSort(int list[], int arraySize);
int D_linearSearch(int key, int list[], int arraySize);
int D_binarySearch(int key, int list[], int arraySize);
double D_fact(int n);
int baseConversion(int num, int a);
double D_power(double x, int y;
#endif _MY_FUNC_H_
源文件 my_func.cpp
#include <stdio.h>
#include <math.h>
#include "my_func.h"
int D_isLeapYear(int year) {
return (year % 4 == 0 && year % 100 != 0) ||( year % 400 == 0);
}
int D_isPrimenum(int num){
int limit;
if (num <= 1)return 0;
else if (num == 2)return 1;
else if (num % 2 == 0)return 0;
else
{
limit = sqrt(num) + 1;
for (int i=3;i<=limit;i+=2)
{
if (num % i == 0)
{
return 0;
break;
}
else return 1;
}
}
}
double D_computeArea(double r) {
const double PI = 3.14159;
double area = 0;
if (r > 0) area = PI * r * r;
return area;
}
void D_swap(int* a, int* b) {
int tmp = 0;
tmp = *a;
*a = *b;
*b = tmp;
}
int D_bubbleSort(int list[], int arraySize) {
int pass, i;
for (pass = 1; pass < arraySize; pass++)
{
for (i=0;i<arraySize-pass;i++)
{
if (list[i]>list[i+1])
{
D_swap(&list[i], &list[i + 1]);
}
}
}
}
int D_linearSearch(int key, int list[], int arraySize) {
int i;
for (i=0;i<arraySize;i++)
{
if (key == list[i]) return i;
}
return -1;
}
int D_binarySearch(int key, int list[], int arraySize) {
int low, mid, high;
low = 0; high = arraySize - 1;
while (low<=high)
{
mid = (low + high) / 2;
if (key < list[mid])
{
high = mid - 1;
}
else if (key > list[mid])
{
low = mid + 1;
}
else
return mid;
}
return -1;
}
double D_fact(int n) {
double t = 1.0;
for (int i = 0;i<=n;i++)
{
t *= i;
}
return t;
}
int baseConversion(int num,int a) {
int n = 0, i = 0;
while (num)
{
n += num % a * i;
num /= a;
i * 10;
}
return n;
}
double D_power(double x, int y) {
double t = 1.0;
for (int i = 0; i<y;i++)
{
t *= x;
}
return t;
}