定义一个大小为10的int类型数组，从键盘输入其元素，然后从小到大排序后输出 定义一个数组大小为10的int数组,并能接受用户输入数据,然...
\u7528c\u8bed\u8a00\u7b54\u9898\uff0c\u5b9a\u4e49\u4e00\u4e2a\u5927\u5c0f\u4e3a10\u7684int\u7c7b\u578b\u6570\u7ec4\uff0c\u4ece\u952e\u76d8\u8f93\u5165\u5176\u5143\u7d20\uff0c\u7136\u540e\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u540e\u8f93\u51fa\u3002#include "stdio.h"
#define N 10
int main(int argc,char *argv[]){
int a[N],i,j,k;
printf("Please enter %d integer(s)...\n",N);
for(i=0;i<N;scanf("%d",a+i++));//\u8f93\u5165
printf("\nAfter ascending sort of output:\n");
for(i=0;i<N;i++){
for(k=i,j=k+1;j<N;j++)
if(a[k]>a[j])
k=j;
if(k!=i)
j=a[k],a[k]=a[i],a[i]=j;
printf("%d ",a[i]);
}
printf("\n");
return 0;
}
\u4ee3\u7801\u548c\u8fd0\u884c\u6837\u4f8b\u56fe\u7247\uff1a
/*
* \u529f\u80fd:\u5b9a\u4e49\u4e00\u4e2a\u6570\u7ec4\u5927\u5c0f\u4e3a10\u7684int\u6570\u7ec4,\u5e76\u80fd\u63a5\u53d7\u7528\u6237\u8f93\u5165\u6570\u636e,\u7136\u540e\u5bf9\u6570\u7ec4\u8fdb\u884c\u6392\u5e8f\u8f93\u51fa.
*/
import java.util.Scanner;
public class text {
public static void main(String[] args) {
int []num=new int[10];
Scanner scan = new Scanner(System.in);
System.out.println("\u8f93\u5165\u5341\u4e2a\u6570\u5b57");
for(int i=0;i<num.length;i++)
num[i]=scan.nextInt();
/*
* \u5192\u6ce1\u6392\u5e8f\u6cd5
*/
int temp;
for(int j=num.length-1;j>0;j--){
for(int i=0;i<j;i++){
if(num[i]>num[i+1]){
temp=num[i];
num[i]=num[i+1];
num[i+1]=temp;
}
}
}
System.out.println("\u6309\u4ece\u5c0f\u5230\u5927\u987a\u5e8f\u6392\u5e8f\u4e3a");
for(int i=0;i<num.length;i++)
System.out.print(num[i]+" ");
}
}
//从大到小排序
for(int i = 0; i < 10; i++){ //假设i=最大值，i<这10个数,i就一直替换下去
for(int j = i+1; j < 10; j++) { //假设j=i的值+1，j<这10个数,j也循环下去
if(src[i]<src[j]) //如果前一个元素小于后一个元素{
int temp;//临时变量
temp = src[i];
src[i] = src[j]; //大的元素到前一个位置
src[j] = temp;//小的元素到后一个位置}}}
for(int k = 0; k < 10; k++) //输出各数据
cout<<src[k]<<endl;
return 0;
}
#include<stdio.h>
#define N 10
void main() { int i,j,k,a[N];
for ( i=0;i<N;i++ ) scanf("%d",&a[i]);
for ( i=0;i<N-1;i++ )
for ( j=i+1;j<N;j++ )
if ( a[i]>a[j] ) { k=a[i]; a[i]=a[j]; a[j]=k; }
for ( i=0;i<N;i++ ) printf("%d ",a[i]); printf("
");
}
#include "stdio.h"
#define N 10
int main(int argc,char *argv[]){
int a[N],i,j,k;
printf("Please enter %d integer(s)...
",N);
for(i=0;i<N;scanf("%d",a+i++));//输入
printf("
After ascending sort of output:
");
for(i=0;i<N;i++){
for(k=i,j=k+1;j<N;j++)
if(a[k]>a[j])
k=j;
if(k!=i)
j=a[k],a[k]=a[i],a[i]=j;
printf("%d ",a[i]);
}
printf("
");
return 0;
}
代码和运行样例图片：
int 数组
if条件语句
哦呢口路他家扑克牌啦
绛旓細include <stdio.h>int main(){ int a[10]={1,2,3,4,5,6,7,8,9,10}; int i,j,t; for(i=1;i<10;i++) for(j=0;j<10-i;j++) { if (a[j]
绛旓細for(j = 0;j<len-1-i;j++){ if(arr[j]>arr[j+1]){ temp = arr[j];arr[j] = arr[j+1];arr[j+1] = temp;} } } } void printArr(int arr[],int len){ int i;for(i = 0;i<len;i++)printf("%d ",arr[i]);printf("\n");} int main(){ int arr[10]= {...
绛旓細include<stdio.h> void sort(int arr[],int len){ int temp;for(int i = 0;i<len/2-1;i++){ for(int j = 0;j<len/2 - i -1;j++){ if(arr[j]>arr[j+1]){ temp = arr[j];arr[j] = arr[j+1];arr[j+1]= temp;} } } for(int m = len/2,k=0;m<len-1;...
绛旓細param type 姣旇緝绫诲瀷 return 鑻>b 杩斿洖true / public static boolean compare(int a, int b, String type) { int hundredsDigitA = a / 100;int tenDigitA = a % 100 / 10;int singleDigitA = a % 100 % 10;int hundredsDigitB = b / 100;int tenDigitB = b % 100 / 10;int ...
绛旓細浠ｇ爜瀹炵幇濡備笅锛歚``java // 瀹氫箟鏁村瀷鍙橀噺num锛屽垵濮嬪涓10 int num = 10;// 灏唍um杞崲涓哄瓧绗︿覆str锛屽苟閫氳繃length()鏂规硶杩斿洖璇ュ瓧绗︿覆鐨勯暱搴 String str = String.valueOf(num);int strLength = str.length();// 灏嗗瓧绗︿覆str杞崲涓烘暣鍨嬪寘瑁呯被瀵硅薄num1 Integer num1 = Integer.valueOf(str);//...
绛旓細include <stdio.h> int main(void){ int i;int a[10];for(i=0;i<10;i++)scanf("%d",&a[i]);for(i=0;i<10;i++)printf("a[%d]=%d\n",i,a[9-i]);return 0;}
绛旓細"+min); System.out.println("骞冲潎鍊硷細"+(sum/10));}绗簩涓細public static void main(String[] args) { //瀹氫箟鏁扮粍 int[][] arr={{1,2,3},{2,4,6}}; for(int i=0;i<arr.length;i++){ //杩欓噷浠庝笅鏍囦负0寮濮嬮亶鍘嗘暟缁 for(int j=0;j<arr[i].length;j...
绛旓細涓嶇煡閬擄紝浣犺C杩樻槸C++锛岀敤C缂栦簡涓涓 浠庡皬鍒板ぇ鍐掓场鎺掑簭锛熶笉鏄お鏄庣櫧 鍐掓场浠庡墠鍚戝悗鍐掓场锛屾帓搴忔垚浠庡皬鍒板ぇ鐨勯『搴忥紙鎴戠殑鐞嗚В锛塱nclude <stdio.h> void sinput(int *p, int n);void sorder(int *p, int n);void display(int *p, int n);int main(int argc, char **agrv){ int a[10];s...
绛旓細include <stdio.h>int main(void){ int a[10] = {0}; /*瀹氫箟澶у皬涓10鐨鏁村舰鏁扮粍锛屽苟鐢0鍒濆鍖栨墍鏈夊厓绱*/ int i; for(i=0;i<10;i++) /*浠庨敭鐩樿緭鍏10涓暟缁勫厓绱*/ scanf("%d", &a[i]); for(i=0;i<10;i++) /*鎶婃暟缁勫厓绱犺緭鍑*/ printf("%d "...
绛旓細int (*(*p)[10])(int *)棣栧厛棰樼洰璇磋澹版槑涓涓暟缁勬寚閽, 涓鑸垜浠兂鍒扮殑鏁扮粍鎸囬拡鏄 闅忎究鏉ヤ竴涓 int(*p)[10], 鐒跺悗鍙堣姣忎釜鍏冪礌鏄竴涓鍑芥暟鎸囬拡,閭ｄ箞鎴戜滑渚挎潵涓涓 鍑芥暟鎸囬拡 int (*pf)(int *) . 鐒跺悗鎶(*p)[10]浣滀负涓涓暣浣撴浛浠 pf 鍗 int(*(*p)[10]))(int *); 鍒...
