int main(int argc, const char *argv[]) { int pont, numeros[5], i; for (i=0;i<5;i++)//Pede os 5 valores do vetor { printf("Digite um número do vetor: "); scanf("%d", &numeros[i]); } select_sort(numeros); //Chama a função para ordenar o vetor printf("O vetor ordenado é: \n"); for (i=0;i<5; i++)//Imprime o vetor { printf(" %d ", numeros[i]); } printf("\n");//apenas vaidade return 0; }
int main() { int num,i; int a[10]={4,6,8,2,9,1,3,10,5,7}; printf("please input one number from 0ne to five:\n"); scanf("%d",&num); switch(num) { case 1: select_sort(a,10);print_(a,10);break; case 2: insert_sort(a,10);print_(a,10);break; case 3: bubble_sort(a,10);print_(a,10);break; case 4: quick_sort(a,10);print_(a,10);break; case 5: heap_sort(a,10);print_(a,10);break; default: printf("input error");break; } return 0; }
void sort(t_heap **a_heap, t_heap **b_heap, t_opt *opt, int *sorted) { int nbr_elem; nbr_elem = get_nbr_elem(a_heap); if (is_sort(a_heap) != 1) { if (nbr_elem == 2) { swap_two_first_elem(a_heap); print_ft("sa", opt); } else if (nbr_elem == 3) if_three_elem(a_heap, opt); else if (nbr_elem < 25) select_sort(a_heap, b_heap, opt); else handle_sort(a_heap, b_heap, opt, sorted); } }
int main(int argc, char *argv[]) { // Need a length if (argc < 2) errx(1, "missing array len"); size_t len = strtoul(argv[1], NULL, 10); // Create and fill array int *arr = malloc(len * sizeof (int)); fill_array(arr, len); // Print the array print_array(arr, len); // Sort array using your code select_sort(arr, len); // Print it again print_array(arr, len); // Assertion: verify that array is sorted assert(is_sorted(arr, len)); return 0; }
int main() { int i; #ifdef DEBUG freopen("./in", "r", stdin); freopen("./out", "w", stdout); #endif scanf("%d", &n); for(i = 0; i < n; i++) scanf("%d", &vec[i]); tot = 0; /*select sort process*/ select_sort(vec, n); printf("%d\n", tot); for(i = 0; i < tot; i++) printf("%d %d\n", ans[i][0], ans[i][1]); return 0; }
int main(int argc,char* argv[]) { int arr[N] = {0}; srand(time(NULL)); int index; printf("before sort:\n"); for(index=0;index<N;index++) { arr[index] = rand()%100; printf("%3d",arr[index]); } printf("\n"); select_sort(arr,N); printf("after sort:\n"); for(index=0;index<N;index++) { printf("%3d",arr[index]); } printf("\n"); }
int main(int argc, char **argv) { int value[] = { 50, 33, 66, 72, 72, 11, 29, 45, 93, 26, 17, 49, 63, }; int i = 0; printf("排序之前的数据:\n"); for(i = 0; i < sizeof(value)/sizeof(int); i++) { printf("%d ", value[i]); } select_sort(value, sizeof(value)/sizeof(int)); printf("\n排序之后的数据:\n"); for(i = 0; i < sizeof(value)/sizeof(int); i++) { printf("%d ", value[i]); } printf("\n"); system("PAUSE"); return 0; }
int main(void) { int i = 0; int num[] = {2,4,6,8,0,1,3,5,7,9}; int len = sizeof(num) / sizeof(num[0]); printf("排序前的数组为:\n"); for(i = 0;i < len;i ++) { printf("%3d",num[i]); } printf("\n"); select_sort(num,len); //选择排序函数 printf("排序后的数组为:\n"); for(i = 0;i < len;i ++) { printf("%3d",num[i]); } printf("\n"); return 0; }
void testSort() { int x[] = {7,3,4,8,8,5,1,2,4}; int a[9]; printArray(x,9); memcpy(a,x,sizeof(int)*9); cout<<"merge sort:"<<endl; merge_sort(a, 0, 8); printArray(a, 9); memcpy(a,x,sizeof(int)*9); cout<<"fast sort:"<<endl; fast_sort(a, 0, 8); printArray(a, 9); memcpy(a,x,sizeof(int)*9); cout<<"bubble sort:"<<endl; bubble_sort(a, 9); printArray(a, 9); memcpy(a,x,sizeof(int)*9); cout<<"select sort:"<<endl; select_sort(a, 9); printArray(a, 9); memcpy(a,x,sizeof(int)*9); cout<<"insert sort:"<<endl; insert_sort(a, 9); printArray(a, 9); memcpy(a,x,sizeof(int)*9); cout<<"count sort:"<<endl; count_sort(a, 9); printArray(a, 9); }
void main(void) { int *dest; dest = (int *)malloc(sizeof(unsorted)); //bubble restore_element(dest, LEN); print_element(dest, LEN); bubble_sort(dest, LEN); printf("bubble sorted done!\n"); print_element(dest, LEN); //select restore_element(dest, LEN); print_element(dest, LEN); select_sort(dest, LEN); printf("select sorted done!\n"); print_element(dest, LEN); //insert restore_element(dest, LEN); print_element(dest, LEN); insert_sort(dest, LEN); printf("insert sorted done!\n"); print_element(dest, LEN); //merge restore_element(dest, LEN); print_element(dest, LEN); merge_sort(dest, LEN); printf("merge sorted done!\n"); print_element(dest, LEN); //quick restore_element(dest, LEN); print_element(dest, LEN); quick_sort(dest, LEN); printf("quick sorted done!\n"); print_element(dest, LEN); //rquick restore_element(dest, LEN); print_element(dest, LEN); rquick_sort(dest, LEN); printf("r-quick sorted done!\n"); print_element(dest, LEN); //count restore_element(dest, LEN); print_element(dest, LEN); count_sort(dest, LEN); printf("count sorted done!\n"); print_element(dest, LEN); //radix restore_element(dest, LEN); print_element(dest, LEN); radix_sort(dest, LEN); printf("radix sorted done!\n"); print_element(dest, LEN); free(dest); }
void piece_delete(void) { int n,i,k,nsel_count, type,main_idx,sub_idx; unsigned char *mesh_mask; map_undo_push(); // sort segment so higher indexes are deleted first select_sort(); // selections have multiple polygons in them // so keep a mesh list mesh_mask=(unsigned char*)malloc(map.mesh.nmesh); if (mesh_mask==NULL) return; bzero(mesh_mask,map.mesh.nmesh); // delete selection nsel_count=select_count(); for (n=0;n!=nsel_count;n++) { select_get(n,&type,&main_idx,&sub_idx); switch (type) { case item_map_mesh: if (state.map.select_mode==select_mode_polygon) { map_mesh_delete_poly(&map,main_idx,sub_idx); select_delete_move_index(item_map_mesh,main_idx,sub_idx); break; } if (state.map.select_mode==select_mode_mesh) { if (mesh_mask[main_idx]==0x0) map_mesh_delete(&map,main_idx); mesh_mask[main_idx]=0x1; break; } break; case item_map_liquid: map_liquid_delete(&map,main_idx); break; case item_map_spot: for (i=main_idx;i<map.nspot;i++) { map.spots[i]=map.spots[i+1]; } map.nspot--; break; case item_map_scenery: for (i=main_idx;i<map.nscenery;i++) { map.sceneries[i]=map.sceneries[i+1]; } map.nscenery--; break; case item_map_node: for (i=0;i!=map.nnode;i++) { // clear all linkage if (i==main_idx) continue; for (k=0;k!=max_node_link;k++) { if (map.nodes[i].link[k]==main_idx) map.nodes[i].link[k]=-1; if (map.nodes[i].link[k]>main_idx) map.nodes[i].link[k]--; } } for (i=main_idx;i<map.nnode;i++) { map.nodes[i]=map.nodes[i+1]; } map.nnode--; break; case item_map_light: for (i=main_idx;i<map.nlight;i++) { map.lights[i]=map.lights[i+1]; } map.nlight--; break; case item_map_sound: for (i=main_idx;i<map.nsound;i++) { map.sounds[i]=map.sounds[i+1]; } map.nsound--; break; case item_map_particle: for (i=main_idx;i<map.nparticle;i++) { map.particles[i]=map.particles[i+1]; } map.nparticle--; break; } } free(mesh_mask); select_clear(); map_palette_reset(); main_wind_draw(); }
int main (void) { srand (time (NULL)); int MAX; int data1[MAX]; int data2[MAX]; int data3[MAX]; int data4[MAX]; int data5[MAX]; FILE *fp = fopen("sort.txt","at"); if(fp<0) printf("can't open !\n"); printf("enter a number: "); scanf("%d",&MAX); size_t i; // size_t size = sizeof(data) / sizeof(data[0]); for (i = 0; i < MAX; i++) { printf ("%2d ", data1[i] = rand () % 100); fprintf(fp,"%d ",data1[i]); } fprintf(fp,"\n"); printf ("\n"); bubble_sort (data1, MAX); for (i = 0; i < MAX; i++) { printf ("%2d ", data1[i]); fprintf(fp,"%d ",data1[i]); } fprintf(fp,"\n\n\n"); printf ("\n\n\n"); for (i = 0; i < MAX; i++) { printf ("%2d ", data2[i] = rand () % 100); fprintf(fp,"%d ",data2[i]); } fprintf(fp,"\n"); printf ("\n"); insert_sort (data2, MAX); for (i = 0; i < MAX; i++) { printf ("%2d ", data2[i]); fprintf(fp,"%d ",data2[i]); } fprintf(fp,"\n\n\n"); printf ("\n\n\n"); for (i = 0; i < MAX; i++) { printf ("%2d ", data3[i] = rand () % 100); fprintf(fp,"%d ",data3[i]); } fprintf(fp,"\n"); printf ("\n"); select_sort (data3, MAX); for (i = 0; i < MAX; i++) { printf ("%2d ", data3[i]); fprintf(fp,"%d ",data3[i]); } fprintf(fp,"\n\n\n"); printf ("\n\n\n"); for (i = 0; i < MAX; i++) { printf ("%2d ", data4[i] = rand () % 100); fprintf(fp,"%d ",data4[i]); } fprintf(fp,"\n"); printf ("\n"); quick_sort (data4, 0, MAX-1); for (i = 0; i < MAX; i++) { printf ("%2d ", data4[i]); fprintf(fp,"%d ",data4[i]); } fprintf(fp,"\n\n\n"); printf ("\n\n"); for(i = 0; i<MAX; i++) { printf ("%2d ", data5[i] = rand () % 100); fprintf(fp,"%d ",data5[i]); } fprintf(fp,"\n"); printf ("\n"); QuickSort(data5, 0, MAX-1); for (i = 0; i < MAX; i++) { printf ("%2d ", data5[i]); fprintf(fp,"%d ",data5[i]); } fprintf(fp,"\n\n\n"); printf ("\n\n\n"); fclose(fp); return 0; }
main() { int vet[N]={35,29,25,12,10,9,24,31,2}; select_sort(vet,N); system("pause"); }