Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
método de ordenamiento insertion sort
#include <stdio.h> #include <stdlib.h> void insertionSort(int *, int); int main(void) { int vector[5] = { 90, 80, 70, 60, 50}; int N = 5; int i; // Ordenar de menor a mayor. insertionSort(vector, N); for (i = 0 ; i < N ; i++) printf("%d ", vector[i]); return 0; } void insertionSort(int *vector, int N) { int i; int j; int pivote; for ( i = 1 ; i < N ; i++) { pivote = vector[i]; j = i - 1; // Ciclo para el desplazamiento while ( (j >= 0) && (vector[j] > pivote) ) { vector[j + 1] = vector[j]; j --; } // Inserción. vector[j + 1] = pivote; } }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Lab6 v1.0 Sin,cos,tan,cot
18BCE2182 ASSESS_1 Q1-7
A_141110_Perfecto
level9
18BCE2182 ASSESS_1 Q1-9
Spring 2017 Project 2 v1.3
a3 commented
FileCat
add.c
C_141126_ArrayMayorMenor02
Please log in to post a comment.