#include <stdio.h> #include <stdlib.h>void array_sort(int *a, int len) {int i, j, tmp;for (i = 0; i < len - 1; i++){for (j = i + 1; j < len; j++){if (a[i] > a[j]){tmp = a[i];a[i] = a[j];a[j] = tmp;}}}for (i = 0; i < len; i++){printf("%d ", a[i]);}system("pause"); }void main() {int a[] = { 1, 2, 4, 0, 2, 6, 5, 9 }, len = sizeof(a) / sizeof(a[0]);;array_sort(a, len); }
数组排序冒泡。最简单的冒泡，没啥好讲的 #include<iostream> using namespace std;void BubbleSort(int a[],int len){int i,j;int tmp;for(i = 0;i < len;i++){for(j = i+1;j < len;j++){if(a[i] > a[j]){tmp = a[i];a[i] = a[j];a[j] = tmp;}}} } void Print(int a[],int len){for(int i = 0; i < len;i++){cout<<a[i]<<" ";}cout<<endl; } int main(){int a[] = {2,4,5,4,77,3};BubbleSort(a,6);Print(a,6);return 0; }
返回一个数组排序后的索引经常在项目中用到，所以这里总结一下c++和python两种语言的实现。 Python#!/usr/local/bin/python3a=[2,3,4,5,63,4,32,3]# ascending #sorted sorted_indx = [idx for idx,v in sorted(enumerate(a), key=lambda x: x[1])] print("ascending sorted:", sorted_indx)#numpy import numpy as np sorted_indx = np.argsort(a) print("ascending argsort:", sorted_indx)# descending #sorted sorted_indx = ...
1 #include<stdio.h>2 #include<stdlib.h>3 #include<windows.h>4 5 #define SIZE 5 //数组中元素的数量6 7 void swap(int *p1, int *p2) //交换数组中的两个元素8 {9 int temp = *p1; //创建变量储存元素p1的指针 10 *p1 = *p2; //将元素p1的指针改为元素p2的指针 11 *p2 = temp; //将元素p2的指针改为之前存储的元素p1的指针 12 } 13 14 int main() //程序从这里开始运行 15 { 16 int array[SIZE]; //创建...