weeeeeeeeeek11

讀入整數反序列印

#include <stdio.h>
int a[20];
int N=0;
int main()
{
int now;
while(1)
{
scanf("%d",&now);
if(now==0)
{
break;
}
a[N]=now;
N++;
}
for(int i=N-1;i>=0;i--)
{
printf("%d ",a[i]);
}
printf("\n");
}
大小寫轉換

#include <stdio.h>
char line[20];
int main()
{
scanf("%s",line);

for(int i=0;line[i]!=0;i++)
{
char c=line[i];
if( c>='A' && c<='Z'){
line[i]=c-'A'+'a';
}else if(c>='a'&&c<='z'){
line[i]=c-'a'+'A';
}
}
printf("%s\n",line);
}
泡泡排序法

//int []a=new int[10];//Java's Array
//int []a={3,0,1,8,7,2,5,4,6,9};//https://www.youtube.com/watch?v=lyZQPjUT5B4
//int []a={6,3,5,9,1,0,4,2,7,8};
//int []a={1,2,3,5,0,4,6,7,8,9};
//int []a={0,9,1,2,3,5,4,6,7,8};//對於快要排好的東西, 特別快!!!
int []a={9,8,7,6,5,4,3,2,1,0};//最糟的狀況:全倒 => QQ
void setup(){
  size(500,800);
  //for(int i=0;i<10;i++){//random choose number
  //  a[i]=int(random(10));//亂數決定數字
  //}
  textSize(36);
  textAlign(LEFT,TOP);
  showArray(y);
}
int y=0;
void showArray(int y){
  for(int i=0;i<10;i++){
    fill(255);  rect(i*50, y, 50,50);
    fill(0);         text(a[i], i*50, y);
  }
}
void draw(){

}
void mousePressed(){
  for(int i=0; i<10-1;i++){
    if(a[i] > a[i+1]){
      int temp=a[i];
      a[i]=a[i+1];
      a[i+1]=temp;
      fill(255,0,0,128); rect(i*50, y, 100,50);
    }
  }
  y+=50;
  showArray(y);
}