C++编程:整数奇偶排序 将10个整数按升序排列输出，并且奇数在前，偶数在后。C++编...
C\u8bed\u8a00\uff1a\u6574\u6570\u5947\u5076\u6392\u5e8f\uff0c\u6c42\u5177\u4f53\u7a0b\u5e8f#include
#define N 10
void main()
{
int a[N]={0},flag[N]={0};
int i,j,t=0,temp=0,g=1;;
for(i=0;i<N;i++)
{
scanf("%d",&a[i]);
if(a[i]%2==0)
flag[i]=1;
else
flag[i]=0;
}
for(i=0;i<N-1;i++)
{
for(j=0;j<N-i-1;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
t=flag[j];
flag[j]=flag[j+1];
flag[j+1]=t;
}
}
for(i=N-1;i>=0;i--)
if(flag[i]==0)
printf("%d ",a[i]);
for(i=0;i<N;i++)
if(flag[i]==1)
printf("%d ",a[i]);
}
#include
#include
using namespace std;
int main()
{#define N 10
int a[N],i;
cout<<"input "<<N<<" number:"<<endl;
for(i=0;i>a[i];
int cmp(const void *,const void *);
qsort(a,N,sizeof(int),cmp);
cout<<"sorted array:"<<endl;
for(i=0;i<N;i++)cout<<a[i]<<" ";
}
int cmp(const void *a,const void *b)
{int i=(*(int*)a)%2-(*(int*)b)%2;
if(i)return -i;
else return (*(int*)a)-(*(int*)b);
}
void jiangxu(int a[],int n)
{
int i,j,t;
for(i=0;i<n-1;i++)
{
for(j=i;j<n;j++)
if(a[i]<a[j])
{t=a[i];a[i]=a[j];a[j]=t;}
}
}
void shengxu(int a[],int n)
{
int i,j,t;
for(i=0;i<n-1;i++)
{
for(j=i;j<n;j++)
if(a[i]>a[j])
{
t=a[i];a[i]=a[j];a[j]=t;
}
}
}
void main()
{
int a[10]={1,2,3,4,5,6,7,8,9,0};
int odd[10];//构造一个数组用以存放奇数
int even[10];//构造一个数组用以存放奇数
int *p,*q,i,odds(0),evens(0);//odds,enevs存放a[]中奇数与偶数的个数
p=odd;q=even;//指针指向数组头
for(i=0;i<10;i++)
{
if(a[i]%2){*(p++)=a[i],odds++;} //奇数存入odd[]
else {*(q++)=a[i],evens++;}//偶数放入even[]
}
jiangxu(odd,odds); //奇数降序排序
shengxu(even,evens);//偶数升序排序
cout<<"a:";
for(i=0;i<10;i++)
cout<<a[i];
cout<<endl;
cout<<"奇数";
for(i=0;i<odds;i++)
cout<<odd[i];
cout<<endl;
cout<<"偶数";
for(i=0;i<evens;i++)
cout<<even[i];
cout<<endl;
}
还有不解情继续提问~
#include <iostream>
using namespace std;
void BubbleSort(int a[],int n)
{
int temp=0;
bool flag=false;
for (int i=0;i<n;i++)
{
for (int j=0;j<n-1-i;j++)
{
if (a[j]>a[j+1])
{
flag=true;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
if (!flag)
{
cout<<"排序"<<i<<"轮结束！"<<endl;
break;
}
flag=false;
}
}
void main()
{
int a[10]={1,2,3,4,5,6,7,8,9,0};
int lenOfArr=sizeof(a)/sizeof(a[0]);
BubbleSort(a,lenOfArr);
cout<<"排序之后，数组序列为："<<endl;
for (int i=0;i<lenOfArr;i++)
{
cout<<a[i]<<" ";
}
cout<<endl<<"奇数降序排列为："<<endl;
for (i=lenOfArr-1;i>=0;i--)
{
if (a[i]%2==1)
{
cout<<a[i]<<" ";
}
}
cout<<endl<<"偶数升序排列为："<<endl;
for (i=0;i<lenOfArr;i++)
{
if (a[i]%2==0)
{
cout<<a[i]<<" ";
}
}
cout<<endl;
}
#include<stdio.h>
void main()
{ int a[10],i,j,temp;
for(i=0;i<10;i++)
scanf("%d",&a[i]);
for(i=0;i<9;i++) // 降序排列
for(j=i+1;j<10;j++)
if(a[i]<a[j]) { temp=a[i]; a[i]=a[j]; a[j]=temp; }
printf("\n输出奇数：");
for(i=0;i<10;i++) //从前往后输出奇数
if(a[i]%2) printf("%d ",a[i]);
printf("\n输出偶数：");
for(i=9;i>=0;i--) //从后往前输出偶数
if(a[i]%2==0) printf("%d ",a[i]);
}
#include<iostream>
using namespace std;
int main()
{
int i,j,item;
int a[10]={0};
while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9]){
for(i=0;i<9;i++){
for(j=0;j<9-i;j++){
if(a[j]>a[j+1]){
item=a[j];
a[j]=a[j+1];
a[j+1]=item;
}
}
}
for(i=9;i>=0;i--){
if(a[i]%2!=0)
cout<<a[i]<<" ";
}
for(i=0;i<10;i++){
if(a[i]%2==0)
cout<<a[i]<<" ";
}
cout<<endl;
}
return 0;
}
应该可以吧.
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#define N 10
using namespace std;
void foo(vector<int> ,bool=true);
template<typename T>
void PrintRecords(T i)
{
cout <<i <<" ";
}
int main(int argc,char *argv[])
{
vector<int> Records1;
vector<int> Records2;
int iR;
cout <<"please enter " <<N <<" numbers" <<endl;
for(int i=0;i<N;i++)
{
cin >>iR;
if(iR%2==1)
Records1.push_back(iR);
else
Records2.push_back(iR);
}
foo (Records1,true);
foo (Records2,false);
system("pause");
return 0;
}
void foo(vector<int> Records,bool c)
{
if(c)
sort(Records.begin(),Records.end(),greater<float>());
else
sort(Records.rbegin(),Records.rend(),greater<float>());
for_each(Records.begin(),Records.end(),PrintRecords<float>);
cout <<endl;
}
绛旓細define N 10 void main(){ int a[N]={0},flag[N]={0};int i,j,t=0,temp=0,g=1;;for(i=0;i<N;i++){ scanf("%d",&a[i]);if(a[i]%2==0)flag[i]=1;else flag[i]=0;} for(i=0;i<N-1;i++){ for(j=0;j<N-i-1;j++)if(a[j]>a[j+1]){ temp=a[...
绛旓細} jiangxu(odd,odds); //濂囨暟闄嶅簭鎺掑簭 shengxu(even,evens);//鍋舵暟鍗囧簭鎺掑簭 cout<<"a:";for(i=0;i<10;i++)cout<<a[i];cout<<endl;cout<<"濂囨暟";for(i=0;i<odds;i++)cout<<odd[i];cout<<endl;cout<<"鍋舵暟";for(i=0;i<evens;i++)cout<<even[i];cout<<endl;} 杩樻湁涓...
绛旓細void main(){ int a[300],i,j,t,n;scanf("%d",&n);for(i=0;i<n;i++) scanf("%d",&a[i]);for(i=0,j=n-1;i<j;){ if(a[i]%2==0&&a[j]%2==0){//if璇彞涓嬫湁涓ゆ潯瀛愬彞锛岃鍔犫渰}鈥漣++;j--;} if(a[i]%2!=0&&a[j]%2!=0){//if璇彞涓嬫湁涓ゆ潯瀛愬彞锛岃...
绛旓細浠"+ "鏂鎺掑簭浠ュ悗杈撳嚭锛堜篃鎸夌┖鏍煎垎闅旓級锛鏁存暟濂囧伓鎺掑簭");List<Integer> list = new ArrayList<Integer>();Scanner in = new Scanner(System.in);for(int i=0;i<10;i++) {list.add(in.nextInt());}System.out.println("鎺掑簭鍓嶇殑鍊硷細");format(list);paixu(list);...
绛旓細import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in);int[] a = new int[10];int[] b = new int[10];int c;for (int i = 0; i < 10; i++)a[i] = cin.nextInt();// Arrays.sort(a);for (int...
绛旓細涓ㄥ憸鍛煎搥鍝 閲囩撼鐜:40% 鎿呴暱: C/C++ 鍏朵粬缂栫▼璇█ VC++ 鍏朵粬鍥炵瓟 c++閲岄潰鏈夊鍣╩ap,浣犳妸10涓暟寰map閲岄潰鏀,鏈夐噸澶嶇殑浼氳嚜鍔ㄨ鐩,10涓斁瀹屼簡濡傛灉浣犵粺璁ap鍙湁9涓厓绱,閭ｄ箞琛ㄧず鏈夐噸澶嶃 铔嬪３鍎挎紓 | 鍙戝竷浜2010-09-10 涓炬姤| 璇勮(1) 0 1 鐢ㄦ暟缁勫彲浠ヤ笉? haomcgrady | 鍙戝竷浜2010-09-10 涓炬姤|...
绛旓細瀛楃鏁扮粍鏄彲浠ョ敤杩欑鏂瑰紡杈撳嚭鐨,鍥犱负鏁扮粍鍚嶅嵆浠ｈ〃棣栧湴鍧,鏁扮粍鏄竴鍧楄繛缁殑鍐呭瓨绌洪棿,鎵浠ヨ兘鐩存帴杈撳嚭.濡傛灉鏄叾浠栫被鍨嬬殑鏁扮粍鍒欒緭鍑虹殑鏄竴涓湴鍧.
绛旓細(6)鐔熺粌鎺屾彙C绋嬪簭璁捐璇█,浠ュ強C++銆丣ava銆乂isual Basic涓殑涓绉嶇▼搴忚璁¤瑷; (7)鐔熸倝鏁版嵁搴撱佺綉缁滃拰澶氬獟浣撶殑鍩虹鐭ヨ瘑; (8)鎺屾彙杞欢宸ョ▼鐨勫熀纭鐭ヨ瘑,浜嗚В杞欢杩囩▼鍩烘湰鐭ヨ瘑銆佽蒋浠跺紑鍙戦」鐩鐞嗙殑甯歌瘑; (9)浜嗚В甯哥敤淇℃伅鎶鏈爣鍑嗐佸畨鍏ㄦ,浠ュ強鏈夊叧娉曞緥銆佹硶瑙勭殑鍩烘湰鐭ヨ瘑; (10)浜嗚В淇℃伅鍖栥佽绠楁満搴旂敤鐨勫熀纭鐭ヨ瘑; (11...
绛旓細C鍜孋++閮芥湁,浣嗛鐩毦搴︿笉澶,姹囩紪璇█涓嶈,寤鸿澶氱湅鐪嬭蒋浠跺伐绋嬬殑鐞嗚鐭ヨ瘑,鑰冨緱寰堝,鐗瑰埆鍦ㄤ笅鍗堛傝繕鏈夋搷浣滅郴缁,缂栬瘧鍘熺悊绛夎窡璁＄畻鏈轰笓涓氱浉鍏崇殑鐞嗚涓嬮潰缁欏嚭澶х翰:杞欢璁捐甯堣冭瘯澶х翰 涓銆佽冭瘯璇存槑 1.鑰冭瘯瑕佹眰: (1) 鎺屾彙鏁版嵁琛ㄧず銆佺畻鏈拰閫昏緫杩愮畻; (2) 鎺屾彙鐩稿叧鐨勫簲鐢ㄦ暟瀛︺佺鏁ｆ暟瀛︾殑鍩虹鐭ヨ瘑; (3) 鎺屾彙璁＄畻鏈轰綋绯...
绛旓細(6)鐔熺粌鎺屾彙C绋嬪簭璁捐璇█,浠ュ強C++銆丣ava銆乂isual Basic鍏朵腑涓绉嶇▼搴忚璁¤瑷; (7)鐔熸倝鏁版嵁搴撱佺綉缁滃拰澶氬獟浣撶殑鍩虹鐭ヨ瘑; (8)鎺屾彙杞欢宸ョ▼鐨勫熀纭鐭ヨ瘑,浜嗚В杞欢杩囩▼鍩烘湰鐭ヨ瘑銆佽蒋浠跺紑鍙戦」鐩鐞嗙殑甯歌瘑; (9)浜嗚В甯哥敤淇℃伅鎶鏈爣鍑嗐佸畨鍏ㄦ,浠ュ強鏈夊叧娉曞緥銆佹硶瑙勭殑鍩烘湰鐭ヨ瘑; (10)浜嗚В淇℃伅鍖栥佽绠楁満搴旂敤鐨勫熀纭鐭ヨ瘑; (11)...
