#log

#include<stdio.h>
#include<stdlib.h>
int main(void){
	int size=7;
    int arr[size]={1,98,4,7,68,23,40};
	int swap;
	for(int i=0;i<size;i++){
        for(int j=0;j<size;j++){
            if(arr[j]>arr[j+1]){
                swap=arr[j];
                arr[j]=arr[j+1];
                arr[j+1]=swap;
            }
        }
    }
    printf("排序後的陣列資料為");
    for(int i=1;i<=size;i++){
        if(i==size){
        	printf("%d",arr[i]);
		}else{
			printf("%d,",arr[i]);
		}
    }
}

============================================
#include<stdio.h>
#include<stdlib.h>
int main(void){
    int a=3,b=2,ele=6;
    int arr[a][b]={
        {1,2},
        {3,4},
        {5,6}
    };
    // 翻轉
	int arr1[a][b];
	printf("翻轉後");
    for(int i=0;i<a;i++){
        for(int j=0;j<b;j++){
            int swap;
            arr1[a-i-1][j]=arr[i][j];
            arr1[i][j]=arr[a-i-1][j];
            if(i==a-1&&j==b-1){
            	printf("%d",arr1[i][j]);
			}else{
				printf("%d,",arr1[i][j]);
			}
        }
    }
    // 旋轉
    printf("旋轉後");
    int arr2[b][a];
    for(int i=0;i<b;i++){
    	for(int j=0;j<a;j++){
    		arr2[i][j]=arr1[a-j-1][i];
    		if(i==b-1&&j==a-1){
            	printf("%d",arr2[i][j]);
			}else{
				printf("%d,",arr2[i][j]);
			}
		}
	}
}