Please enable JavaScript.
Coggle requires JavaScript to display documents.
SLR 7 - Coggle Diagram
SLR 7
Merge Sort
- very efficient as to can work on multiple things at the same time
- breaking down big lists to smaller lists - divide an conquer
- good for big data sets - anything bigger than 500 items
- splitting initial lists into lists of 1 item
- then it compares the adjacent item
- then it compares the new list created from the first item in each list followed by the second etc.
- repeat it until it is sorted
Bubble Sort
- sorts an unordered list of terms
- this makes it a popular choice for very small data sets
- effective up to around 500 items
-
- it compares each item with the next and swaps them if there out of order
Linear Search
- check every time in a linear fashion to see if it matches
- straight forward and easy, it doesn't require any order
- efficient for small data sets but it gets so much slower for larger sets
- if the item is not in the search range the computer still has to search every item in the list
Binary Search
- the data set must be in order and has to be couples with one of the sorting algorithms
- breaks the data set into halves
- much much faster than linear search
- its much harder to code though
Decomposition
Decomposition - breaking down larger problems to make it subproblems to make it easier and in manageable chunks. it saves a lot of time and effort and parts can be cut out and reused.
Advantages
- makes problems easier to solve
- different people can work on different problems to fix a big problem
- reducing development time
- program components developed in one program can easily be used in another programs
-
Trace Tables
- a table tracking the variables as they go through the program
- every time a new variable is changed a new line is needed