用c语言怎么做索引数组 c语言可以用字符串作为数组的索引名(键名)吗

c\u8bed\u8a00\u7f16\u5199\u7d22\u5f15\u6570\u7ec4

#include void main(void){ int i, j; int a[5] = {5, 4, 2, 3, 1}; int b[5] = {0, 1, 2, 3, 4}; //\u4e0b\u6807\u5e8f\u53f7\uff0c\u6570\u91cf\u591a\u5c31\u81ea\u589e\u8d4b\u503c int c , d; printf("\u539f\u6570\u7ec4:\n"); for(i = 0; i a[j+1])//\u4ece\u5c0f\u5230\u5927 \u5192\u6ce1\u6cd5 \u4ea4\u6362\u5927\u5c0f \u540c\u65f6\u4ea4\u6362\u4e0b\u89d2\u6807 { c = a[j]; a[j] = a[j+1]; a[j+1] = c; d = b[j]; b[j] = b[j+1]; b[j+1] = d; } } } printf("\n\u6570\u7ec4:\n"); for(i = 0; i < 5; i++) { printf("%2d", a[i]); } printf("\n\u4e0b\u6807:\n"); for(i = 0; i < 5; i++) { printf("%2d", b[i]); } getchar();}

\u5b57\u7b26\u4e32\u4e0d\u53ef\u4ee5\uff0c\uff0c\uff0c\uff0c\uff0c\uff0c\u6570\u5b57\u6027\u8d28\u7684\u503c\uff0c\u5982int


~~~~~~~~~

用索引做排序就可以了
void select_sort(int *a, int len) {
int Min;
int *index;
index=(int *)new int[len];
for ( int i=0;i<len;i++ ) index[i]=i;

for (int i = 0; i < len - 1; i++) {
for (int j = 1 + i; j < len; j++) {
if (a[index[i]] > a[index[j]]) {
Min=index[i];
index[i]=index[j];
index[j]=Min;
}
}
}
for ( int i=0;i<len;i++ ) cout<<index[i]<<' '; cout<<endl;
for ( int i=0;i<len;i++ ) cout<<a[index[i]]<<' '; cout<<endl;
delete [] index;
}

  • c璇█缂栧啓绱㈠紩鏁扮粍
    绛旓細include <stdio.h>void main(void){ int i, j; int a[5] = {5, 4, 2, 3, 1}; int b[5] = {0, 1, 2, 3, 4}; //涓嬫爣搴忓彿锛屾暟閲忓灏辫嚜澧炶祴鍊 int c , d; printf("鍘鏁扮粍:\n"); for(i = 0; i < 5; i++) { printf("%2d", a[i])...
  • 鐢╟璇█鎬庝箞鍋氱储寮曟暟缁
    绛旓細鐢绱㈠紩鍋鎺掑簭灏卞彲浠ヤ簡 void select_sort(int *a, int len) { int Min;int *index;index=(int *)new int[len];for ( int i=0;i<len;i++ ) index[i]=i;for (int i = 0; i < len - 1; i++) { for (int j = 1 + i; j < len; j++) { if (a[index[i]] > a...
  • C璇█绱㈠紩鏁扮粍鎺掑簭
    绛旓細搴旇鏄绱㈠紩鎺掑簭鑰屽鏁扮粍涓嶆帓搴忚岃揪鍒版湁搴忚緭鍑哄師鏁扮粍鐨勭洰鐨勩備妇渚嬩唬鐮佸涓嬶細//#include "stdafx.h"//If the vc++6.0, with this line.#include "stdio.h"int main(void){ int array[10] = {4,3,2,1,5,0,6,9,7,8},index[10],i,j,k; for(i=0;i<10;index[i]=i++)...
  • 鍦浣跨敤c璇█涓,鏁扮粍鍏冪礌鍙互閫氳繃绱㈠紩璁块棶鍚
    绛旓細鏁扮粍鍏冪礌鍙互閫氳繃鏁扮粍鍚嶇О鍔犵储寮曡繘琛岃闂銆傚厓绱犵殑绱㈠紩鏄斁鍦ㄦ柟鎷彿鍐咃紝璺熷湪鏁扮粍鍚嶇О鐨勫悗杈广傛暟缁勪腑鐨勬瘡涓厓绱犳槸浣跨敤褰㈠紡涓 a[ i ] 鐨勫厓绱犲悕绉版潵鏍囪瘑鐨勶紝鍏朵腑 a 鏄暟缁勫悕绉帮紝i 鏄敮涓鏍囪瘑 a 涓瘡涓厓绱犵殑涓嬫爣銆傛瘮濡俛[10]鐨勪笅鏍囨渶灏忎负0锛屾渶澶т负9锛屼笖涓瀹氭槸鏁存暟锛岃秴鍑烘鑼冨洿鐨勯兘涓嶆槸姝g‘鐨勩
  • C璇█涓粈涔堟槸绱㈠紩??
    绛旓細int start;//瀛愯〃涓涓涓厓绱犳墍鍦ㄧ殑涓嬫爣浣嶇疆 int length;//瀛愯〃鐨勯暱搴﹀煙 };2.棣栧厛鏍规嵁缁欏畾鐨绱㈠紩鍊糑1锛屽湪绱㈠紩琛ㄤ笂鏌ユ壘鍑虹储寮曞肩瓑浜嶬1鐨勭储寮曢」锛屼互纭畾瀵瑰簲瀛愯〃鍦ㄤ富琛ㄤ腑鐨勫紑濮嬩綅缃拰闀垮害锛岀劧鍚庡啀鏍规嵁缁欏畾鐨勫叧閿瓧K2锛屽湪瀵瑰簲鐨勫瓙琛ㄤ腑鏌ユ壘鍑 3銆傚叧閿瓧绛変簬K2鐨勫厓绱犮傝鏁扮粍A鏄叿鏈塵ainlist绫诲瀷鐨...
  • 濡備綍鐢╟璇█瀹炵幇浜岀淮鏁扮粍?
    绛旓細浣跨敤 C 璇█瀹炵幇浜岀淮鏁扮粍鍙互閫氳繃浠ヤ笅姝ラ锛1. 澹版槑涓涓簩缁存暟缁勫彉閲忥細棣栧厛锛岄渶瑕佸0鏄庝竴涓簩缁存暟缁勫彉閲忔潵瀛樺偍鏁版嵁銆傚0鏄庝簩缁存暟缁勯渶瑕佹寚瀹氭暟缁勭殑琛屾暟鍜屽垪鏁帮紝骞跺彲浠ョ粰鏁扮粍鍛藉悕銆2. 鍒濆鍖栦簩缁存暟缁勶細鍙互閫夋嫨鍦ㄥ0鏄庝簩缁存暟缁勬椂鍒濆鍖栵紝鎴栬呭湪鍚庣画鐨勪唬鐮佷腑鍒濆鍖栨暟缁勩傚彲浠ヤ娇鐢ㄥ惊鐜粨鏋勬潵閬嶅巻鏁扮粍鐨勬瘡涓厓绱狅紝骞...
  • 濡傛灉鎯冲湪c璇█涓浣跨敤鏁扮粍,璇濡備綍瀹炵幇鍛?
    绛旓細绛旓細int i=0;for(i=0;i<n;i++)if(arr[i]%5==0)if(arr[i]<m)m=arr[i];
  • 濡備綍鐢–璇█鍒涘缓涓涓鏁扮粍?
    绛旓細鍦 C 璇█涓0鏄庝竴涓瓨鏀 n 涓暣鏁扮殑鏁扮粍鍙互浣跨敤濡備笅璇硶锛氬叾涓紝array_name 鏄綘缁欐暟缁勮捣鐨勫悕绉帮紝n 鏄暣鏁扮殑涓暟銆傝娉ㄦ剰锛宯 鍦ㄥ0鏄庢暟缁勬椂蹇呴』鏄竴涓‘瀹氱殑鏁存暟锛屽嵆鍦ㄧ紪璇戞椂蹇呴』鐭ラ亾鏁扮粍鐨勫ぇ灏忋備緥濡傦紝濡傛灉浣犳兂澹版槑涓涓瓨鏀 5 涓暣鏁扮殑鏁扮粍锛屽彲浠ヨ繖鏍峰啓锛氳繖鏍峰氨鍒涘缓浜嗕竴涓悕涓 my_array 鐨勬暟缁...
  • 濡備綍鐢╟璇█瀹氫箟鏁扮粍鍜岀煩闃?
    绛旓細3銆鏁扮粍锛堟垨鐭╅樀锛夊厓绱犵殑寮曠敤锛屽紩鐢ㄦ牸寮忎负鈥滄暟缁勫悕(n,m)鈥濓紝濡傚畾涔夆淎=[1 2 3;4 5 6]鈥濊繖涓涓よ涓夊垪鐭╅樀A锛屼护b=A(2,3)锛岃〃绀篵绛変簬A鐭╅樀绗簩琛岀涓夊垪鐭╅樀鐨勫硷紝浠跨湡缁撴灉濡備笅銆4銆佺敤鈥淏=cell(2,3)鈥濈敓鎴愮┖鐨2琛3鍒楃粨鏋勪綋锛屾帴鐫閫氳繃鈥淏{n,m}=?鈥濆懡浠や负缁撴瀯浣撳厓绱犺祴鍊硷紝濡傝緭鍏...
  • C#鐨鏁扮粍涓C璇█鐨勬暟缁勫畾涔夊拰浣跨敤鏈夐偅浜涘樊鍒?
    绛旓細C# 鏁扮粍浠庨浂寮濮嬪缓绔嬬储寮曪紝鍗鏁扮粍绱㈠紩浠庨浂寮濮嬨侰# 涓暟缁勭殑宸ヤ綔鏂瑰紡涓庡湪澶у鏁板叾浠栨祦琛璇█涓殑宸ヤ綔鏂瑰紡绫讳技銆備絾杩樻湁涓浜涘樊寮傚簲寮曡捣娉ㄦ剰銆俓x0d\x0a\x0d\x0a澹版槑鏁扮粍鏃讹紝鏂规嫭鍙 ([]) 蹇呴』璺熷湪绫诲瀷鍚庨潰锛岃屼笉鏄爣璇嗙鍚庨潰銆傚湪 C# 涓紝灏嗘柟鎷彿鏀惧湪鏍囪瘑绗﹀悗鏄笉鍚堟硶鐨勮娉曘俓x0d\x0a\x0d...
  • 扩展阅读:c++编程 ... 大一c语言编程题库100题 ... c语言必背100代码 ... 索引数组界限解决方法 ... 数控车床最简单的编程 ... c++必背入门代码 ... matlab索引超出数组边界 ... 索引超出范围解决方法 ... 索引超出数组界限解决办法 ...

    本站交流只代表网友个人观点,与本站立场无关
    欢迎反馈与建议,请联系电邮
    2024© 车视网