19.01 - Algorithms Flashcards

1
Q

Binary search

A

A method of searching an ordered list by testing the value of the middle item in the list and rejecting the half of the list that does not contain the required value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Insertion sort

A

A method of sorting data in an array into alphabetical or numerical order by placing each item in turn in the correct position in the sorted list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Binary tree

A

A hierarchical data structure in which each parent node can have a maximum of two child nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Graph

A

A non-linear data structure consisting of nodes and edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Dictionary

A

An abstract data type that consists of pairs, a key, and a value, in which the key is used to find the value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Big O notation

A

A mathematical notation used to describe the performance or complexity of an algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly