无详细内容 无 struct node{int value;int index;};void BubbleSort(node * pData, int Count){node iTemp;for (int i = 1; i Count; i++){for (int j = Count - 1; j = i; j--){if (pData[j].value pData[j - 1].value){iTemp = pData[j - 1];pData[j - 1] =
struct node { int value; int index; }; void BubbleSort(node * pData, int Count) { node iTemp; for (int i = 1; i< Count; i++){ for (int j = Count - 1; j >= i; j--){ if (pData[j].value< pData[j - 1].value){ iTemp = pData[j - 1]; pData[j - 1] = pData[j]; pData[j] = iTemp; } } } } int _tmain(int argc, _TCHAR * argv[]) { int A[] = { 5, 3, 4, 7, 3, 5, 6 }; int len = sizeof(A) / sizeof(int); int levelA[sizeof(A) / sizeof(int)]; node nodeA[sizeof(A) / sizeof(int)]; for (int i = 0; i < len; ++i) { nodeA[i].value = A[i]; nodeA[i].index = i; } BubbleSort(&nodeA[0], len); int level = 1; levelA[nodeA[0].index] = level; for (int i = 1; i < len; ++i) { if (nodeA[i - 1].value != nodeA[i].value){ ++level; } levelA[nodeA[i].index] = level; } return 0; }