Revision

Revision

1. what is an algorithm?

   • A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
   • algorthm flashcards
     • Algorithms ♡

2. Flowchart symbols

   • The Oval. Start and end. The Rectangle. Process. The Arrow. Directional Flow. . The Diamond. Decision.
   • Flowchart symbols flashcards
     • Flowchart symbols

3. linear and binary search algorithms

   • 1. Sequential: The linear search follows sequence and Binary search doesn’t follow. The linear search starts searching from the starting to ending point. Binary searching starts from the middle point. 2. Sorted: For binary search, we need sorted elements. Linear search does not need sorted elements. It searches all the element in all position until it gets the desired elements. 3. Comparison: The number of comparison in Binary Search is less than Linear Search as Binary Search starts from the middle. . 4. Time Complexity: the Binary search is quicker as it doesn't go through every individual number.
   • linear and binary search algorithms flashcards
     • Algorithms sorting and searching revision
   • How the linear search works
     • In computer science, a linear search or sequential 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.

4. Decomposition

   • Decomposition in computer science, also known as factoring, is breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain.
   • computational thinking flashhcards
     • Computational Thinking ♡

5. The merge sort

   • Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, it is sorted by definition (the base case). If the list has more than one item, we split the list and recursively invoke a merge sort on both halves.
   • merge sort flashcards
     • Data Structures - Sorting and Searching

6. What is abstraction?

   • The abstraction principle is used to reduce complexity and allow efficient design and implementation of complex software systems.

7. The bubble sort

   • Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent pairs and swaps them if they are in the wrong order.
   • Bubble sort mind map
     • Bubble Sort

Images and files in the map