Por actualizar!
Algoritmo Complejidad Intercambios ( peor caso )
## Sort
Burbuja ( Bubblesort ) - O(n^2) - ( n^2 - n )/2
Insercion (Insertion sort) - O(n^2) - ( n^2 - n )/2
Selecion (Selection sort) - O(n^2) - ( n^2 - n )/2
SHELL (SHELL sort) - O(n^1.25) - ( n^2 - n )/2
Burbuja Bidireccional (Shaker Sort) - O(n^2) - ( n^2 - n )/2
Merge - O( Nlog2(N) ) ( Natural )
Quick - O(nlogn) ( natural )
Radix
## Search
Jump - O(√n)
Sequential Search - O(n)
Binary Search - O(log n)