Mapa mental
Sorting
Contenido del mapa
Sorting
Insertion sort
- Best Case = O(n) Worst Case = O(n^2) Average Case = O(n^2)
Mergesort
- Best / Worst / Average Case = O(n log n)
Selection Sort
- Best Case = O(n) Worst Case = O(n^2) Average Case = O(n^2)
Quick sort (Pivot)
- Best case = O(n log n) Worst case = O(n^2)
Heap
- Insertion / Deletion= O(log n)
- Heapsort = O(n log n)
Binary Search Tree
- CRUD = O(h) where h is height
- Average case = O(log n)
Información
- Descripción
- Mapa Mental sobre Sorting, creado por dadelgado01 el 11/11/2014.
- Creado por
- dadelgado01 · nov 2014
- Actualizado
- 19 feb 2016
- Visitas
- 14
- Valoración