unit 2.1 algorithms

unit 2.1 algorithms

1. decomposition

   • meaning -- breaking down problems into smaller tasks

2. computational thinking

   • meaning -- the use of computers to solve problems

3. abstraction

   • meaning -- which info is useful/ get rid of irrelevant info

4. algorithmic thinking

   • identifying steps to solve problems

5. linear search

   • each item in the list is checked in order

6. binary search

   • an ordered list is divided in 2 with each comparrison

7. bubble sort

   • moving through a list repeatedly, swapping elements that are in the wrong order

8. merge sort

   • a list is split into individual lists, these are then combined (2 lists at a time)

9. list

   • a set of data

10. insertion sort

    • each items is take in turn, compare to the items in a sorted list and placed in the correct position

11. ordered list

    • elements are arranged in sequence

12. unordered list

    • unarranged elements

13. algorithm

    • the series of steps to solve a problem or preform an action

14. flowchart

    • a diagram that shows the inputs, outputs and processes in an algorithms

15. process

    • an action that takes place

16. pseudocode

    • simplified programming code that is not language specific, used to design algorithms

17. dry run

    • walking through an algorithm which sample data, running each step manually

18. trace table

    • a table that follows the values of variables to check for accuracy