void Init_ar(int* br, int n)//初始化函数
{
//srand(time(NULL));
int cr[101] = {};
int i = 0;
while (i < n)
{
br[i] = rand() % 100 + 1;
if (cr[br[i]] == 0)
{
cr[br[i]] = 1;
++i;
}
}
}
void manpao_ar(int* br, int n)//冒泡排序方便检查
{
assert(br != nullptr);
for (int i = 0; i < n - 1; ++i)
{
for (int j = 0; j < n - i - 1; ++j)
{
if (br[j] > br[j + 1])
{
int k = br[j+1];
br[j + 1] = br[j];
br[j] = k;
}
}
}
}
void Print_ar(const int* br, int n)//打印函数
{
for (int i = 0; i < n; ++i)
{
printf("%3d", br[i]);
if (i % 10 == 9)
printf("\n");
}
}
int main()
{
int ar[100] = { 0 };
int n = sizeof(ar)/sizeof(ar[0]);
Init_ar(ar, n);
manpao_ar(ar, n);
Print_ar(ar, n);
return 0;
}
产生随机值1-100并且不重复***(用了查表法)
最新推荐文章于 2021-06-07 17:29:27 发布