实验8.1 指针与数组（Experiment 8.1 pointers and arrays）.doc
文本预览下载声明
实验8.1 指针与数组（Experiment 8.1 pointers and arrays）
Experiment 8.1 pointers and arrays
Subject information table
Serial number name title title out of Title scoring title number
1 cycle (mobile debugger error08_1)
2 in the array to find the specified element
3 ranking selection method using function
4 report
1 cycle (mobile debugger error08_1)
#include stdio.h
Int main (void)
{
Int i, m, N, K, j;
Int a[80];
Scanf (%d%d, n, m);
For (I = 0; I n; i++)
Scanf (%d, a[i]);
For (i=0; im; i++) {
K=a[n-1];
For (j=n-1; j0; j--)
A[j]=a[j-1];
A[0]=k;
}
/*----- program to fill in the blank, dont change the input and output of the statement.
Enter two positive integers n and m (1mn=10), and then enter the n integer, the number in a row, right circular mobile m position (from the right out of the number of moves from left),
The final output after moving integer n.
The definition of requirements and call a function mov (x, N, m) to realize the circular movement function, type function parameter x is an integer pointer type parameter n and M is int, the type of the function is void.
The input and output sample: in brackets below
Input:
53 (n=5, m=3)
12345 (5 integers)
Output:
After move: 34512
----*/
Printf (After move:);
For (I = 0; I n; i++)
Printf (%d, a[i]);
Printf (\n);
Return 0;
}
2 in the array to find the specified element
#include stdio.h
Int main (void)
{
Int i, N, res, x;
Int repeat, ri;
Int a[10];
Scanf (%d, repeat);
For (RI = 1; RI repeat; ri++) {
Scanf (%d, n);
For (I = 0; I n; i++)
Scanf (%d, a[i]);
Scanf (%d, x);
Res=-1;
For (i=0; in; i++)
If (a[i]==x) {
Res=i;
Break;
}
/*---- program to fill in the blank, dont change the input and output of the statement.
Enter a positive integer repeat (0repeat10), repeat times the following operations:
Enter a positive integer n (1n=10), and then enter the N integers into an array a, and then enter an integer x, a in the array to find x,
If you find the smallest subscript outputs corresponding elements, otherwise output Not found.
显示全部