- Dec 01 Tue 2015 19:36
-
[C] Queue delete and insert
- Dec 01 Tue 2015 19:33
-
[C] delete queue 3
- Nov 20 Fri 2015 17:18
-
[C]PUSH STACK
#include <stdio.h>
//push 東西到stack裡面
void push(int stack[],int n,int *top,int data)
{
if(*top<n-1)
{
*top=*top+1;
stack[*top]=data;
printf("stack[%d]=%d\n",*top,stack[*top]);
}
else
{
printf("full!!\n");
}
}
//push 東西到stack裡面
void push(int stack[],int n,int *top,int data)
{
if(*top<n-1)
{
*top=*top+1;
stack[*top]=data;
printf("stack[%d]=%d\n",*top,stack[*top]);
}
else
{
printf("full!!\n");
}
}
- Nov 20 Fri 2015 13:56
-
[C]二分搜尋法 使用迴圈
//while binary search
#include <stdio.h>
/*binary search 使用while loop */
int binarysearch(int *list,int middle,int left,int right,int key)
{
while(left<right)
{
if(key==list[middle])
{
return middle;
}
else if(key<list[middle])
{
right=middle;
middle=(left+right)/2;
}
else
{
left=middle;
middle=(left+right)/2;
}
}
#include <stdio.h>
/*binary search 使用while loop */
int binarysearch(int *list,int middle,int left,int right,int key)
{
while(left<right)
{
if(key==list[middle])
{
return middle;
}
else if(key<list[middle])
{
right=middle;
middle=(left+right)/2;
}
else
{
left=middle;
middle=(left+right)/2;
}
}
- Nov 20 Fri 2015 13:54
-
[C]二分搜尋法 使用遞迴
#include <stdio.h>
//recursive binary search
int bisearch(int key,int *list,int right,int left)
{
int middle=(left+right)/2;
//recursive binary search
int bisearch(int key,int *list,int right,int left)
{
int middle=(left+right)/2;
- Nov 20 Fri 2015 13:52
-
[C]循序搜尋 使用遞迴
//recursive sequential search
#include <stdio.h>
int search(int *list,int length,int key)
{
if(length==0)
return (-1);
else if(key==list[length-1])
return(length-1);
else
return(search(list,length-1,key));
#include <stdio.h>
int search(int *list,int length,int key)
{
if(length==0)
return (-1);
else if(key==list[length-1])
return(length-1);
else
return(search(list,length-1,key));
- Nov 20 Fri 2015 13:50
-
[C]循序搜尋 使用while迴圈
//while sequentialsearch
#include <stdio.h>
int seqsearch(int n,int *list)
{
int i=0;
while(i!=10)
{
if(n==list[i])
{
return i;
}
i++;
}
return printf("False!!");
#include <stdio.h>
int seqsearch(int n,int *list)
{
int i=0;
while(i!=10)
{
if(n==list[i])
{
return i;
}
i++;
}
return printf("False!!");
- Nov 19 Thu 2015 11:11
-
[C] 最大公因數GCD(使用迴圈)
- Nov 19 Thu 2015 11:09
-
[C] 使用遞迴算最大公因數 GCD
#include <stdio.h>
#include <stdlib.h>
/* recursive GCD */
int GCD(int t,int v)
{
if(t%v==0)
{
return v;
}
#include <stdlib.h>
/* recursive GCD */
int GCD(int t,int v)
{
if(t%v==0)
{
return v;
}
- Nov 18 Wed 2015 23:48
-
[C]印星星
- Nov 18 Wed 2015 23:18
-
[C]統一編號是否合法(整數)
#include <stdio.h>
#include <string.h> //字串要記得宣告
int parse_int(int arr)
{
int i,sum=0,remainder;
remainder=arr%10;
arr/=10;
for(i=0;i<7;i++)
{
sum+=arr%10*(i+2);//12345678%10=8 arr=1234567
arr/=10; //1234567%10=7 arr123456
}
#include <string.h> //字串要記得宣告
int parse_int(int arr)
{
int i,sum=0,remainder;
remainder=arr%10;
arr/=10;
for(i=0;i<7;i++)
{
sum+=arr%10*(i+2);//12345678%10=8 arr=1234567
arr/=10; //1234567%10=7 arr123456
}
