选择排序算法

it2022-05-09  26

#include <stdio.h> int get_min_of_array(int * array ,unsigned int index_start,unsigned int index_end){ int min = array[index_start]; int min_index = 0; for(int i = index_start; i < index_end; i ++){ if(array[i] <= min){ min = array[i]; min_index = i; } } return min_index; } void select_sort(int * array,int length){ int min_index = 0; int temp = 0; for(int i = 0; i < length; i ++){ min_index = get_min_of_array(array,i,length); temp = array[i]; array[i] = array[min_index]; array[min_index] = temp; } } int main() { int array[] = {3,41,52,26,38,57,9,49}; int length = sizeof(array) / sizeof(array[0]); select_sort(array,length); for(int i = 0; i < sizeof(array)/ sizeof(array[0]); i ++){ printf("%d ",array[i]); } return 0; }

 


最新回复(0)