Unit 1 Sorting Algorithms

?
Algorithms
a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
1 of 7
Abstraction
Removing unnecessary details to make it quicker and easier to understand and process
2 of 7
Decomposition
Breaking the problem into smaller parts
3 of 7
Linear
It counts them one by one, easy but it takes longer
4 of 7
Binary
Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, look in the lower half
5 of 7
Linear advantages and disadvantages
Easy to do but takes a lot of time
6 of 7
Binary advantages and disadvantages
Extremely quick but harder to do and takes up more space
7 of 7

Other cards in this set

Card 2

Front

Removing unnecessary details to make it quicker and easier to understand and process

Back

Abstraction

Card 3

Front

Breaking the problem into smaller parts

Back

Preview of the back of card 3

Card 4

Front

It counts them one by one, easy but it takes longer

Back

Preview of the back of card 4

Card 5

Front

Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, look in the lower half

Back

Preview of the back of card 5
View more cards

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Unit 1 resources »