2.1 Algorithms

2.1 Algorithms

1. sorts

   • bubble sort
     • Works by repeatedly going through the list to be sorted, comparing each pair of adjacent elements
     • Data
     • information
     • Knowledge
   • insertion sort
     • Sorts data one element at a time.
       • The algorithm takes one data item from the list and places it in the correct location in the list.
         • This is repeated until there are no more unsorted items in the list.
           • An insertion sort is more efficient than a bubble sort
   • Merge sort
     • This is a two-stage sort
       • Firstly the list is split in half into sub lists repeatedly
         • The second stage involves repeatedly merging the lists in order until there is only one sub list remaining.

2. Linear search

   • is a method for finding an element within a list
     • It sequentially checks each element of the list until a match is found or the whole list has been searched

3. Binary

   • A Binary search is a search that halves each answer until it comes to a final answer
   • Also Known as
     • Half-interval search
     • Logariyhmic search
     • Binary chop

4. Arrays

   • A set of dat elements stored under the same name

5. Binary

   • A Binary search is a search that halves each answer until it comes to a final answer.
   • Different names for binary search
     • Half-interval search
     • Logarithmic search
     • Binary chop
   • steps for a Binary search
     • 1.The list needs to be in order
     • 2.take the middle value
     • 3.Compare to the middle value you are looking for.
     • 4.If it is the value you are looking for celebrate and stop
     • 5.Elseif it is larger than the one you are looking for

6. Linear

   • A Linear search is a method for finding an element within a list
     • It sequentially checks each element a list until a match is found
   • Different names for linear search
     • Sequential search
   • Steps of a Linear search
     • 1.check the first value.
     • 2.If it is the value you are looking for. Celebrate and stop
     • 3.Else move to check the next vault
     • 4.Repeat Until you have checked all the elements until it finds the value you have been looking for

7. Arrays

   • An array is a set of data elements stored under the same name
     • Arrays can be created to hold any type of data, and each element can be individually assigned and read

8. Golden triangle

   • A Golden triangle holds Meta data

9. Meta data

   • A set of data that describes and gives information about other data

10. SQL

    • structure quory language