Unit 1 sorting algorithums

?
Algorithum
A set of rules followed by a computer
1 of 7
Abstraction
Removing Unnecessary details to make it easier to understand
2 of 7
Decompostion
Breaking problems into smaller parts
3 of 7
Linear
It counts them one by one easier to understand but slower
4 of 7
Binary
Splits the numbers down the middle until it finds the answer Harder to understand but faster
5 of 7
Merge Sort
It splits it into small chunks, it is fast but hard to code and takes up more memory
6 of 7
Bubble sort
looks at two and swaps them and moves on, its slow it takes up less space and i easier to code
7 of 7

Other cards in this set

Card 2

Front

Removing Unnecessary details to make it easier to understand

Back

Abstraction

Card 3

Front

Breaking problems into smaller parts

Back

Preview of the back of card 3

Card 4

Front

It counts them one by one easier to understand but slower

Back

Preview of the back of card 4

Card 5

Front

Splits the numbers down the middle until it finds the answer Harder to understand but faster

Back

Preview of the back of card 5
View more cards

Comments

Xx420BlazeItxX

Report

Absolute banger

Similar Computing resources:

See all Computing resources »See all Sorting Algorithims resources »