c语言中合并两个降序数组,使合并后的数组仍然保持降序排列 将两个按升序排列的数组合并成一个数组,并使合并后的数组也按升...
c\u8bed\u8a00\u6307\u9488\u5408\u5e76\u4e24\u4e2a\u5347\u5e8f\u6570\u7ec4\u8fd8\u5347\u5e8f#includevoid merge(char *dest, char *src1, char *src2){while (*src1 && *src2){if (*src1 < *src2){*dest++ = *src1++;}else{*dest++ = *src2++;}}while(*src1) *dest++ = *src1++;while(*src2) *dest++ = *src2++;}int main(int argc, char* argv[]){chardest[30] = {0};char*src1 = "1359";char*src2 = "24578";merge(dest, src1, src2);printf("%s\n", dest);return 0;}
#include using namespace std;void meger(int a[],int b[],int m,int n);int main(){ int A[5]={1,5,3,7,9};//\u5b9a\u4e49\u4e86\u7b2c\u4e00\u4e2a\u6570\u7ec4\u548c\u503c int B[5]={2,4,8,6,10};//\u5b9a\u4e49\u4e86\u7b2c\u4e8c\u4e2a\u6570\u7ec4\u548c\u503c meger(A,B,5,5);//\u8c03\u7528\u51fd\u6570 return 0;}void meger(int a[],int b[],int m,int n){ int *R=new int[m+n]();//new\u4e00\u4e2a\u65b0\u6570\u7ec4\uff0c\u957f\u5ea6\u662f\u4e24\u4e2a\u6570\u7ec4\u957f\u5ea6\u4e4b\u548c int u=0; int i=0; while(ii;j--) { if(R[j]<R[j-1]) { temp=R[j]; R[j]=R[j-1]; R[j-1]=temp; } } i++; } i=0; while(i<m+n)//\u8f93\u51fa\u6392\u5e8f\u597d\u7684\u6570\u7ec4 { cout<<R[i]<<" "; i++; }}
#include<stdio.h>
#include<stdlib.h>
#define N 100
int cmp(const void*a,const void*b)
{//快速排序比较函数
int *x=(int*)a;
int *y=(int*)b;
return *y-*x;
}
int main()
{
int a[N]={9,7,5,3,1};
int b[N]={8,6,4,2,0};
int sum[2*N]={0};//合并数组
int k=0;//合并数组元素个数的计数
for(int i=0;i<5;i++)
{
sum[k++]=a[i];//a数组元素赋值给sum数组
}
for(int i=0;i<5;i++)
{
sum[k++]=b[i];//b数组元素赋值给sum数组
}
qsort(sum,10,sizeof(sum[0]),cmp);//降序排序
for(int i=0;i<k;i++)//输出
printf("%d ",sum[i]);
return 0;
}
绛旓細include <stdio.h> main(){ int i,j,a[5],b[5],c[10],temp;for(i=0;i<5;i++)scanf("%d",&a[i]);for(i=0;i<5;i++)scanf("%d",&b[i]);for(i=0;i<5;i++){ c[i]=a[i];c[i+5]=b[i];} printf("\n");for(j=0;j<9;j++)for(i=0;i<9-j;i++)i...
绛旓細"); scanf("%d",&x); for(i=0;i<5;i++) if(x>a[i]) break; for(j=5;j>i;j--) a[j]=a[j-1]; a[j]=x; printf("Now array a:\n"); for(i=0;i<6;i++) printf("%4d",a[i]...
绛旓細8086姹囩紪浠ｇ爜锛歛(array1)銆乥(array2)涓ゆ暟缁鍧囦负闄嶅簭鎺掑垪锛屽厓绱犱釜鏁颁笉闄愩傜▼搴忛噸鐐规槸濡備綍浣跨敤瀛椾覆鐨勪紶閫佹寚浠わ紙lodsw銆乻tosw銆乵ovsw锛夛紝瀵规暣鏁版暟鎹被鍨嬭岃█锛屾瘮楂樼骇璇█缂栧埗鐨勭▼搴忕畝鏄庡お澶氫簡銆俢ode segment assume cs:code org 100hstart: jmp bbbarray1: dw 89,67,56,45,34,23,12n1 ...
绛旓細//灏嗘柊寤鐨勪袱涓暟缁璧嬪 for (i=0; i<n1; i++){ (L+i)=*(num+start+i);} // 鍝ㄥ叺鍏冪礌 (L+n1)=1000000;for (i=0; i<n2; i++){ (R+i)=*(num+middle+i+1);} (R+n2)=1000000;i=0;// 杩涜鍚堝苟 for (k=start; k<=end; k++){ if(L[i]<=R[j]){ num[k]=...
绛旓細鏁版嵁鐨勪釜鏁扮敱闄愬埗涔堬紵
绛旓細packagecom锛巆n锛巙4锛沬mportjava锛巙til锛嶴canner锛涳紶authorAdministrator锛涘悜鏈搴忔暟缁涓彃鍏ュ鍛樻垚缁╋紱鍦ㄤ竴缁闄嶅簭鎺掑垪鐨勬暟鎹腑鎻掑叆涓涓暟鎹紝鎻掑叆鍚庯紝鏁扮粍涓暟鎹緷鐒舵寜闄嶅簭鎺掑垪 publicclassInsertNum锝 publicstaticvoidmain锛圫tring锛伙冀args锛夛經 锛忥紡瑕佺‘淇濇彃鍏ユ暟鎹湁浣嶇疆锛屽繀椤绘暟缁勯暱搴﹀涓浣嶏紝鎵浠ュ畾涔夋暟缁勭殑...
绛旓細鍗囧簭:int i,j,num;int a[N+1]; //宸叉帓濂藉簭鍒鐨勬暟缁; N鍙敤#define瀹氫箟;杈撳叆鎴栨帓搴忕殑鎿嶄綔鎴戝氨涓嶅仛浜.scanf("%d",&num); //杈撳叆鎻掑叆鐨勬暟 for(i=0;i<N;i++){ if(a[i]>num){ for(j=N;j>i;j--)a[j]=a[j-1];a[i]=num;} } for(i=0;i<N+1;i++)printf("%3d...
绛旓細杩欎釜鏄嚜宸辫緭鍏10涓暣鏁,涓嶆兂鑷繁杈撶殑璇濆氨鍏堢粰鏁扮粍a璧嬪垵鍊,鐒跺悗鎶婁笅闈㈢▼搴忛噷鐨勮緭鍏ヨ鍙ュ幓鎺夊嵆鍙痋x0d\x0a#include \x0d\x0avoid main()\x0d\x0a{\x0d\x0aint i,j,max,temp,a[10];\x0d\x0afor(i=0;i<10;i++)\x0d\x0ascanf("%d",&a[i]);\x0d\x0afor(i=0;i<10;...
绛旓細鍒嗗埆鐢涓や釜鏁扮粍锛瀛樺偍濮撳悕鍜屾垚缁╋紝鎸夋垚缁闄嶅簭鎺掑簭鍚庯紝杈撳嚭濮撳悕锛歩nclude<stdio.h> include<string.h> int main(){ int n,i,j;float a[100],t;char name[100][10],t1[10];scanf("%d",&n);for(i=0; i<n; i++)scanf("%s%f",name[i],&a[i]);printf("===\n");for(i=0;i...
绛旓細鐗瑰埆澶鐨勬暟缁涓嶈鏀惧湪鍑芥暟閲岄潰 鍒嗛厤涓嶄笅鐨 鏀规垚鍏ㄥ眬鍙橀噺 绋嬪簭璨屼技娌￠棶棰 include <stdio.h> int a[2000002],b[1000001];int main(){ int m,n,i,j,temp; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d",&a[i]); scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d"...
