algorithm 2.1

algorithm 2.1

1. abstraction

   • Abstraction is one of the four cornerstones of Computer Science. It involves filtering out – essentially, ignoring - the characteristics that we don't need in order to concentrate on those that we do.

2. algarthmic thinking

   • Algorithmic thinking is a way of getting to a solution through the clear definition of the steps needed – nothing happens by magic. Rather than coming up with a single answer to a problem, like 42, pupils develop algorithms.

3. decomostion

   • 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.

4. seacrching alogorithms

   • binary
     • Advantages: Compared to linear search (checking each element in the array starting from the first), binary search is much faster. Linear search takes, on average N/2 comparisons (where N is the number of elements in the array), and worst case N comparisons.
     • The shape of the tree depends on the order of insertions, and it can be degenerated. When inserting or searching for an element, the key of each visited node. has to be compared with the key of the element to be inserted/found. Keys may be long and the run time may increase much.
   • linear
     • disadvantages: The linear search is inefficient - If the array being searched contains 20,000 elements, the algorithm will have to look at all 20,000 elements in order to find a value in the last element. ... This is assuming that the search item is consistently found in the array. N/2 is the average number of comparisons
     • advantages: The linear search is simple - It is very easy to understand and implement; It does not require the data in the array to be stored in any particular order.
   • bubble sort
     • The main disadvantage of the bubble sort is the fact that it does not deal well with a list containing a huge number of items. This is because the bubble sort requires n-squared processing steps for every n number of elements to be sorted. As such, the bubble sort is mostly suitable for academic teaching but not for real-life applications.
     • The primary advantage of the bubble sort is that it is popular and easy to implement. Furthermore, in the bubble sort, elements are swapped in place without using additional temporary storage, so the space requirement is at a minimum.
   • incersion sort
     • The main advantage of the insertion sort is its simplicity. It also exhibits a good performance when dealing with a small list. The insertion sort is an in-place sorting algorithm so the space requirement is minimal.
     • The disadvantage of the insertion sort is that it does not perform as well as other, better sorting algorithms. With n-squared steps required for every n element to be sorted, the insertion sort does not deal well with a huge list. Therefore, the insertion sort is particularly useful only when sorting a list of few items.
   • merge sort
     • It can be applied to files of any size. Reading of the input during the run-creation step is sequential ==> Not much seeking. Reading through each run during merging and writing the sorted record is also sequential. The only seeking necessary is as we switch from run to run. If heapsort is used for the in-memory part of the merge, its operation can be overlapped with I/O Since I/O is largely sequential, tapes can be used.

5. pseudocode

   • a notation resembling a simplified programming language, used in program design.
   • Disadvantages of Pseudocode. While pseudocode is easy to read, it does not provide as good a map for the programmer as a flowchart does. It does not include the full logic of the proposed code. ... Pseudocode is by nature unstructured, so the reader may not be able to see the logic in a step.
   • It's not visual  Create an additional level of documentation to maintain.  Introduce error possibilities in translating to code.  May require tool to extract pseudocode and facilitate drawing flowcharts.  There is no accepted standard, so it varies widely from company to company  We do not get a picture of the design.  There is no standardized style or format, so one pseudocode may be different from another.  For a beginner, it is more difficult to follow the logic or write pseudocode as compared to flowchart.

6. flowcharts

Imágenes y archivos del mapa