- 論壇徽章:
- 0
|
本帖最后由 router_id 于 2021-04-21 22:56 編輯
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void item_arr(int arr[], unsigned int arr_lenght);
int arr_max(int arr[], unsigned int arr_lenght);
void count_sort(int arr[], unsigned int arr_lenght);
int main(int argc, char *argv[])
{
int arr[] = {2,3,8,7,1,2,2,2,7,3,9,100,2,1,4,2,4,6,9,2};
int arr_lenght = sizeof(arr) / sizeof(int);
// printf("%d", arr_max(arr, arr_lenght));
count_sort(arr, arr_lenght);
return 0;
}
void item_arr(int arr[], unsigned int arr_lenght)
{
int i;
for (i = 0; i < arr_lenght; i++)
{
printf("%d ", arr);
}
printf("\n");
}
int arr_max(int arr[], unsigned int arr_lenght)
{
int i;
int max;
for (i = 0; i < arr_lenght; i++)
{
if (max < arr)
{
max = arr;
}
}
return max;
}
void count_sort(int arr[], unsigned int arr_lenght)
{
if (arr_lenght < 2)
{
return;
}
int iamx = arr_max(arr, arr_lenght);
printf("-->%d", iamx);
//int temp_arr[imax+1];
}
程序返回結果
-->32766運行結束,執行耗時:1毫秒朋友們能幫忙解釋一嗎?
|
|