Fichas
sorting
Fichas del conjunto (12)
- 1Linear Sort a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z find J
- 2Binary Sort 9,7,6,4,3,2,1 find 6
- 3Bubble Sort 5,1,4,2,8 Do a first pass with 5( 5 1 4 2 8 ) –> ( 1 5 4 2 8 )
( 1 5 4 2 8 ) –> ( 1 4 5 2 8 )
( 1 4 5 2 8 ) –> ( 1 4 2 5 8 )
( 1 4 2 5 8 ) –> ( 1 4 2 5 8 ) - 4Merge Sort 5,2,4,6,1,3,2,6 Sort from lowest to biggest
- 5Insert Sort 8,7,5,9,1,6,2,4,3 Sort from lowest to highest
- 6Method For Binary SearchFind midpoint by getting the length of the list and / 2. the answer is midpoint. decide if value trying to find is bigger/smaller than midpoint. ignore everything bigger/smaller and repeat finding midpoint until value is found
- 7Method For Linear SearchSearch from the start to the end of the list until value is found
- 8Method For Bubble Sort1) Compare the first 2 items on the list to see if they are in the right order
2) Swaps over 2 items to match the right order
3) Keeps checking with other items to see if other items are bigger or smaller
4) Moves on to different items to see if they are in the right order - 9Insert Sort MethodStart With 2 numbers and compare them, higher number to the right. add 1 more number and compare with the numbers in the list. repeat until list is sorted.
- 10Abstraction DefinitionTaking off any unnecessary details so it remains with its basic shape
- 11Decomposition DefinitionBreaking down a problem into smaller sub-problems which will be easier to solve. Used in everyday life and programming
- 12—
Información
- Descripción
- Fichas sobre sorting, creado por Patryk Gluszkiewicz el 12/03/2019.
- Creado por
- Patryk Gluszkiewicz · mar 2019
- Actualizado
- 12 mar 2019
- Visitas
- 2
- Valoración