Comp 1 Wordsearch

?
  • Created by: IqbalKhan
  • Created on: 25-04-18 09:41
A way of describing the time and memory complexity of a given algorithm
Big O Notation
1 of 6
An algorithm that calls itself within it's own definition
Recursive
2 of 6
The sort algorithm that compares adjecent values and swaps them if they are in the wrong order
Bubble Sort
3 of 6
The sorting algorithm that makes use of the pivot, a left pointer and a right pointer
Quicksort
4 of 6
Procedural, non-procedural, object oriented, event driven, 4th generation and visual languages are all examples of......
Programming Paradigms
5 of 6
Drivers, microwave oven processors, washing machine processors etc. are all programmed using this type of preogramming language.
low level
6 of 6

Other cards in this set

Card 2

Front

An algorithm that calls itself within it's own definition

Back

Recursive

Card 3

Front

The sort algorithm that compares adjecent values and swaps them if they are in the wrong order

Back

Preview of the front of card 3

Card 4

Front

The sorting algorithm that makes use of the pivot, a left pointer and a right pointer

Back

Preview of the front of card 4

Card 5

Front

Procedural, non-procedural, object oriented, event driven, 4th generation and visual languages are all examples of......

Back

Preview of the front of card 5
View more cards

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Programming & Systems Development resources »