C语言中输入一串字符，怎样让它按照字母从小到大的顺序排列？_百度知道
色情、暴力
我们会通过消息、邮箱等方式尽快将举报结果通知您。
C语言中输入一串字符，怎样让它按照字母从小到大的顺序排列？
C语言中输入一串字符，怎样让它按照字母从小到大的顺序排列？
这可以把字符串输入到字符数组中，然后采用排序的方法来实现：（需要包含&string.h&头文件）char t,s[200];int i,i;gets(s);for(i=0;i&strlen(s)-1;i++)
for(j=0;j&strlen(s)-1-i;j++)
if(s[j]&s[j+1])
{t=s[j]; s[j]=s[j+1]; s[j+1]=t;}puts(s);
采纳率：82%
来自团队：
); strlen(str); ++j)
if(str[i]&gt,str[i]); j& return 0;int main(){ char str[MAX];const int MAX = 10000;str[j])
tempst = str[i];
str[i] = str[j];
} for(i = 0 ; i & printf(& for(int i = 0; i &lt.h&#include & strlen(str); ++i)
printf(&%c&;string.h&gt#include &\n&quot, gets(str); strlen(str); ++i)
for(int j = i + 1
本回答被提问者采纳
用一般排序方法排就是了。直接 用
比较就是了;
你可以参照下这个程序,
字符存储形式为ASCLL码可以把他们看做是一般整数进行排序冒泡，快速，希尔……都可以！
其他2条回答
为您推荐：
其他类似问题
c语言的相关知识
换一换
回答问题，赢新手礼包学习了很久，能看懂简单的程序，却自己不会编写，这是怎么回事呢【c语言吧】_百度贴吧
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&签到排名：今日本吧第个签到，本吧因你更精彩，明天继续来努力！
本吧签到人数：0成为超级会员，使用一键签到本月漏签0次！成为超级会员，赠送8张补签卡连续签到：天&&累计签到：天超级会员单次开通12个月以上，赠送连续签到卡3张
关注：562,891贴子：
学习了很久，能看懂简单的程序，却自己不会编写，这是怎么回事呢收藏
就是自己能够看懂程序，但是如果让我编写的话总是会出错，要么就是不知道怎么下手，但是如果同样的题目，别人编写好了给我看的话，我也感觉：“哦，这也太简单了”。各位老师，你们当初学习的时候也是这样吗？你们是怎么解决的？
自学编程,零基础怎么学习?如何系统,科学地学习编程,成为一名程序员...
C是实践出来的，看再多不如自己编一题，编一题你就会发现自己其实还存在很多问题，很多细节都不懂
你觉得自己编写是什么意思呢?是自己对照课本的程序编写一遍，还是自己看着题目编写？
呵呵，这样下去你只会成为理论家。
“总是会出错”什么样的错?
典型的眼高手低，一看很简单，自己会啊，就不自己动手敲了，把每个自己看过的程序都上机来一遍，别管多简单，哪怕只有一个输出语句，练得多了自然就会了。
动手太少～
说的很对，反正我就是看了感觉会写但是一旦自己编写的话肯定不会，要么就是少打一个符号要么就是方法完全不对，愁啊，听说被程序有用不知真假
登录百度帐号推荐应用"全排列c语言代码"的糗事
你可能感兴趣:
糗事百科为大家收集了很多的全排列c语言代码的糗事，各种关于全排列c语言代码的爆笑经历、尴尬时刻和开心视频，想持续关注全排列c语言代码的糗事就收藏本页吧.
扫码下载糗事百科app175被浏览29150分享邀请回答69 条评论分享收藏感谢收起500分悬赏--大小写全排列C语言代码_百度知道
色情、暴力
我们会通过消息、邮箱等方式尽快将举报结果通知您。
500分悬赏--大小写全排列C语言代码
本人破解了一个无线网密码：083FBF3ADED
可能是大小写区分的问题，所以不能连接上，现在需要穷举每个字母位的大写和小写的全部可能，人工排列怕出错，所以想用编程输出排列结果。
本人的思路是：数字不区分大小写，所以可以先忽略数字，把字母拿出来，那...
本人想给500分，可是系统每次最大设置是100，我可以随便再发几个问题给你冲剩余的分数，所以不要担心没有分，本人分多的是.诸位仁兄不要再让我翻书啊，翻书我是肯定能写出来的，也就不用麻烦各位了。但是本人在国外，书吐血的贵，一本C语言没有RMB300搞不定，我也不想因为这个小程序花那么多钱，希望诸位同胞帮帮忙。
我有更好的答案
序;&; char cseq[] = {3,4,5,7,8,9,10}; char cBig[] = &7, code); }}结果：
0: 083fbf3aded
1: 083Fbf3aded
2: 083fBf3aded
3: 083FBf3aded
4: 083fbF3aded
5: 083FbF3aded
6: 083fBF3aded
7: 083FBF3aded
8: 083fbf3Aded
9: 083Fbf3Aded 10: 083fBf3Aded 11: 083FBf3Aded 12: 083fbF3Aded 13: 083FbF3Aded 14: 083fBF3Aded 15: 083FBF3Aded 16: 083fbf3aDed 17: 083Fbf3aDed 18: 083fBf3aDed 19: 083FBf3aDed 20: 083fbF3aDed 21: 083FbF3aDed 22: 083fBF3aDed 23: 083FBF3aDed 24: 083fbf3ADed 25: 083Fbf3ADed 26: 083fBf3ADed 27: 083FBf3ADed 28: 083fbF3ADed 29: 083FbF3ADed 30: 083fBF3ADed 31: 083FBF3ADed 32: 083fbf3adEd 33: 083Fbf3adEd 34: 083fBf3adEd 35: 083FBf3adEd 36: 083fbF3adEd 37: 083FbF3adEd 38: 083fBF3adEd 39: 083FBF3adEd 40: 083fbf3AdEd 41: 083Fbf3AdEd 42: 083fBf3AdEd 43: 083FBf3AdEd 44: 083fbF3AdEd 45: 083FbF3AdEd 46: 083fBF3AdEd 47: 083FBF3AdEd 48: 083fbf3aDEd 49: 083Fbf3aDEd 50: 083fBf3aDEd 51: 083FBf3aDEd 52: 083fbF3aDEd 53: 083FbF3aDEd 54: 083fBF3aDEd 55: 083FBF3aDEd 56: 083fbf3ADEd 57: 083Fbf3ADEd 58: 083fBf3ADEd 59: 083FBf3ADEd 60: 083fbF3ADEd 61: 083FbF3ADEd 62: 083fBF3ADEd 63: 083FBF3ADEd 64: 083fbf3adeD 65: 083Fbf3adeD 66: 083fBf3adeD 67: 083FBf3adeD 68: 083fbF3adeD 69: 083FbF3adeD 70: 083fBF3adeD 71: 083FBF3adeD 72: 083fbf3AdeD 73: 083Fbf3AdeD 74: 083fBf3AdeD 75: 083FBf3AdeD 76: 083fbF3AdeD 77: 083FbF3AdeD 78: 083fBF3AdeD 79: 083FBF3AdeD 80: 083fbf3aDeD 81: 083Fbf3aDeD 82: 083fBf3aDeD 83: 083FBf3aDeD 84: 083fbF3aDeD 85: 083FbF3aDeD 86: 083fBF3aDeD 87: 083FBF3aDeD 88: 083fbf3ADeD 89: 083Fbf3ADeD 90: 083fBf3ADeD 91: 083FBf3ADeD 92: 083fbF3ADeD 93: 083FbF3ADeD 94: 083fBF3ADeD 95: 083FBF3ADeD 96: 083fbf3adED 97: 083Fbf3adED 98: 083fBf3adED 99: 083FBf3adED100: 083fbF3adED101: 083FbF3adED102: 083fBF3adED103: 083FBF3adED104: 083fbf3AdED105: 083Fbf3AdED106: 083fBf3AdED107: 083FBf3AdED108: 083fbF3AdED109: 083FbF3AdED110: 083fBF3AdED111: 083FBF3AdED112: 083fbf3aDED113: 083Fbf3aDED114: 083fBf3aDED115: 083FBf3aDED116: 083fbF3aDED117: 083FbF3aDED118: 083fBF3aDED119: 083FBF3aDED120: 083fbf3ADED121: 083Fbf3ADED122: 083fBf3ADED123: 083FBf3ADED124: 083fbF3ADED125: 083FbF3ADED126: 083fBF3ADED127: 083FBF3ADED;main(){ char code[]=&083FBF3ADED&, i, i,FBFADED&;;
for(i=0;i& char cSmall[] = &fbfaded&
code[cseq[j]] = cSmall[j];
printf(&%3d: %s\n&(1&7);i++) {
for(j=0;j&j++)
if(i&(1&&j))
code[cseq[j]] = cBig[j]：#include &stdio.h&gt
采纳率：65%
你才100分啊，
这个应该不难,自己在翻翻c语言书,规范下语法就能写了.
1.设有7位数,初始化 0000000 ,然后模仿二进制加法,每次都执行加1操作2.回溯
结果如下：000:
[083fbf3aded]001:
[083fbf3adeD]002:
[083fbf3adEd]003:
[083fbf3adED]004:
[083fbf3aDed]005:
[083fbf3aDeD]006:
[083fbf3aDEd]007:
[083fbf3aDED]008:
[083fbf3Aded]009:
[083fbf3AdeD]010:
[083fbf3AdEd]011:
[083fbf3AdED]012:
[083fbf3ADed]013:
[083fbf3ADeD]014:
[083fbf3ADEd]015:
[083fbf3ADED]016:
[083fbF3aded]017:
[083fbF3adeD]018:
[083fbF3adEd]019:
[083fbF3adED]020:
[083fbF3aDed]021:
[083fbF3aDeD]022:
[083fbF3aDEd]023:
[083fbF3aDED]024:
[083fbF3Aded]025:
[083fbF3AdeD]026:
[083fbF3AdEd]027:
[083fbF3AdED]028:
[083fbF3ADed]029:
[083fbF3ADeD]030:
[083fbF3ADEd]031:
[083fbF3ADED]032:
[083fBf3aded]033:
[083fBf3adeD]034:
[083fBf3adEd]035:
[083fBf3adED]036:
[083fBf3aDed]037:
[083fBf3aDeD]038:
[083fBf3aDEd]039:
[083fBf3aDED]040:
[083fBf3Aded]041:
[083fBf3AdeD]042:
[083fBf3AdEd]043:
[083fBf3AdED]044:
[083fBf3ADed]045:
[083fBf3ADeD]046:
[083fBf3ADEd]047:
[083fBf3ADED]048:
[083fBF3aded]049:
[083fBF3adeD]050:
[083fBF3adEd]051:
[083fBF3adED]052:
[083fBF3aDed]053:
[083fBF3aDeD]054:
[083fBF3aDEd]055:
[083fBF3aDED]056:
[083fBF3Aded]057:
[083fBF3AdeD]058:
[083fBF3AdEd]059:
[083fBF3AdED]060:
[083fBF3ADed]061:
[083fBF3ADeD]062:
[083fBF3ADEd]063:
[083fBF3ADED]064:
[083Fbf3aded]065:
[083Fbf3adeD]066:
[083Fbf3adEd]067:
[083Fbf3adED]068:
[083Fbf3aDed]069:
[083Fbf3aDeD]070:
[083Fbf3aDEd]071:
[083Fbf3aDED]072:
[083Fbf3Aded]073:
[083Fbf3AdeD]074:
[083Fbf3AdEd]075:
[083Fbf3AdED]076:
[083Fbf3ADed]077:
[083Fbf3ADeD]078:
[083Fbf3ADEd]079:
[083Fbf3ADED]080:
[083FbF3aded]081:
[083FbF3adeD]082:
[083FbF3adEd]083:
[083FbF3adED]084:
[083FbF3aDed]085:
[083FbF3aDeD]086:
[083FbF3aDEd]087:
[083FbF3aDED]088:
[083FbF3Aded]089:
[083FbF3AdeD]090:
[083FbF3AdEd]091:
[083FbF3AdED]092:
[083FbF3ADed]093:
[083FbF3ADeD]094:
[083FbF3ADEd]095:
[083FbF3ADED]096:
[083FBf3aded]097:
[083FBf3adeD]098:
[083FBf3adEd]099:
[083FBf3adED]100:
[083FBf3aDed]101:
[083FBf3aDeD]102:
[083FBf3aDEd]103:
[083FBf3aDED]104:
[083FBf3Aded]105:
[083FBf3AdeD]106:
[083FBf3AdEd]107:
[083FBf3AdED]108:
[083FBf3ADed]109:
[083FBf3ADeD]110:
[083FBf3ADEd]111:
[083FBf3ADED]112:
[083FBF3aded]113:
[083FBF3adeD]114:
[083FBF3adEd]115:
[083FBF3adED]116:
[083FBF3aDed]117:
[083FBF3aDeD]118:
[083FBF3aDEd]119:
[083FBF3aDED]120:
[083FBF3Aded]121:
[083FBF3AdeD]122:
[083FBF3AdEd]123:
[083FBF3AdED]124:
[083FBF3ADed]125:
[083FBF3ADeD]126:
[083FBF3ADEd]127:
[083FBF3ADED]
其他2条回答
为您推荐：
其他类似问题
您可能关注的内容
全排列的相关知识
换一换
回答问题，赢新手礼包}