Sort by array variable pointer Selection

Adapt the previous article to use the selection method to calculate 10 integers in ascending orderChange sorting order to pointer

# Include "stdio. H "<br/> void main () <br/>{< br/> void sort (int * X, int N); <br/> int A [10], i, * P; <br/> P = A; <br/> for (I = 0; I <10; I ++) <br/> scanf ("% d", P ++); <br/> printf ("/N"); <br/> P =; <br/> sort (p, 10); <br/> for (P = A; P <A + 10; P ++) <br/> printf ("% d", * P); <br/>}< br/> void sort (int * X, int N) <br/>{< br/> int I, J, K, T; <br/> for (I = 0; I <n-1; I ++) <br/> {<br/> K = I; <br/> for (j = I + 1; j <n; j ++) <br/> If (* (x + J)> * (X + k) k = J; <br/> If (K! = I) <br/> {T = * (x + I); * (x + I) = * (x + k); * (x + k) = T ;}< br/>}< br/> 

For beginners, I only know the following sorting methods: 1. Select method 2. Bubble Method 3. Fast sorting (not used currently). Try again next time.

Looking at multi-dimensional arrays.

Encourage yourself every day and make progress every day! Xi

Stick to it!