ITA - Week 4 Flashcards
1
Q
What is an algorithmic design strategy
A
A general approach to solving problems algorithmically that is applicable to a variety of problems from different areas of computing
2
Q
What is the brute force algorithm strategy
A
A straightforward approach to solving a problem, usually based on the problem statement and definitons of the concepts involved
3
Q
How to derive the time complexity of an algorithm
A
Find how many times it does basic operations
4
Q
What is the bubble sort algorithm
A
Starting from the first element, if they are not in ascending order swap them
5
Q
What is Exhaustive Search
A
To generate every possible element of the problem domain to find a desired element
