Fundamenatal principles and concept of computing Flashcards
is a set of well-defined instructions for performing a task or solving a problem.
ALGORITHM
Precision: Each step is clearly defined.
Finiteness: An algorithm must terminate after a
finite number of steps.
Input and Output: Algorithms take input and
produce output.
Effectiveness: Each operation is basic enough to
be carried out, in principle, by a human using only paper and pencil.
Characteristics of ALGORITHM
QuickSort: Uses divide-and-conquer to sort
elements by partitioning arrays.
MergeSort: Divides the list into halves, sorts
them, and merges them.
Sorting Algorithms:
Binary Search: Efficiently finds an element
in a sorted list by repeatedly dividing the search interval in half.
Linear Search: Checks each element in a
list until the target is found.
Searching Algorithms:
Data structures are specialized formats for organizing ,processing, retrieving, and storing data.
DATA STRUCTURES