null
US
Iniciar Sesión
Regístrate Gratis
Registro
Hemos detectado que no tienes habilitado Javascript en tu navegador. La naturaleza dinámica de nuestro sitio requiere que Javascript esté habilitado para un funcionamiento adecuado. Por favor lee nuestros
términos y condiciones
para más información.
Siguiente
Copiar y Editar
¡Debes iniciar sesión para completar esta acción!
Regístrate gratis
6414358
Chapter 5
Descripción
Algorithms
Sin etiquetas
computer science
computing science
as - level
Mapa Mental por
Karl Taylor
, actualizado hace más de 1 año
Más
Menos
Creado por
Karl Taylor
hace casi 8 años
6
0
0
Resumen del Recurso
Chapter 5
Sorting Algorithms
Bubble Sort
Repeatedly steps through the list to be sorted, compares each pair of items beside each other and swaps them if they are in the wrong order.
Insertion Sort
Works by dividing the list into two parts: sorted and unsorted
Elements are inserted one by one into their correct position in the sorted section
Merge Sort
Quicksort
Steps
1. Take the first item in the list, make it a list one item big and call it the pivot
2. Splits the remainder of the list into two sub-lists: those less than or equal to the pivot and those greater than the pivot
3. Recursively apply step 2 until all sub-lists are pivots
4. The pivots can now be combined to form a sorted list
Search Algorithms
Linear Search
Methodically searches one location after another until the searched-for value is found
Binary Search
Works by dividing the list in two each time until we find the item being searched for
The list must be in order
Complexity
O(x)
X = worst case complexity of the algorithm
n = number of data
Constant complexity
O(1)
Takes the same amount of time to run regardless of the size of a data set
Linear complexity
O(n)
Increase at the same rate as the input size increases
Polynomial complexity
O(n to the power of k) (where k>=0)
Exponential complexity
O(k to the power on n) (where k>0)
Logarithmic complexity
O(Log n)
Shortest path algorithms
Dijkstra's algorithm
Finds the shortest path between two points
A* search
Uses heuristic to find the shortest path between two points
Mostrar resumen completo
Ocultar resumen completo
¿Quieres crear tus propios
Mapas Mentales
gratis
con GoConqr?
Más información
.
Similar
Computing Hardware - CPU and Memory
ollietablet123
SFDC App Builder 2
Parker Webb-Mitchell
Data Types
Jacob Sedore
Intake7 BIM L1
Stanley Chia
Software Processes
Nurul Aiman Abdu
Design Patterns
Erica Solum
CCNA Answers – CCNA Exam
Abdul Demir
Abstraction
Shannon Anderson-Rush
Spyware
Sam2
HTTPS explained with Carrier Pigeons
Shannon Anderson-Rush
Data Analytics
anelvr
Explorar la Librería