algorithms

Question 1

abstraction

Answer 1

ignoring unnecessary info and focus on important ones.
simplifies problems to make it more straightforward

Question 2

decomposition

Answer 2

breaking down problems into smaller task

Question 3

algorithmic thinking

Answer 3

final step after.
problem it broken down by decomposition. The required data and relevant data structures are considered using abstraction.

Question 4

linear search

Answer 4

data is searched in order from start to end until data is found

Question 5

binary search

Answer 5

starts from the middle of the list.
BUT list must be in order.

Question 6

merge sort

Answer 6

divide list into half again and again until data is separated. then combine it back while sorting one by one.

Question 7

bubble sort

Answer 7

comparison of adjasent data

Question 8

insertion sort

Answer 8

checks first value then second then third while swapping values into correct order at the same time until the end.