Asymptotic Notation

What is the goal of analysis of algorithm?

• To compare algorithms in terms of Running Time

• To increase memory space

• To lessen the time in running the program

• To detect virus in the program

It is a way to describe the behavior of functions in the limit or without bounds.

• Algorithm Analysis

• Asymptotic Notation

• Symptotic Notation

• Algorithm Design

What do we mean by Running Time Analysis?

• Determine how running time decreases as the size of the problem decreases

• Determine how running time decreases as the size of the problem increases

• Determine how running time increases as the size of the problem increases

• Determine how running time increases as the size of the problem decreases

It is used to describe the upper bound of an algorithm's running time or space usage.

• Linear Search

• Big Theta Notation

• Big Omega Notation

• Big O Notation

It describes the lower bound of an algorithm's running time or space usage.

• Big O Notation

• Linear Search

• Big Theta Notation

• Big Omega Notation

It is used when an algorithm's time complexity or space complexity is exactly bounded both from above and below.

• Big O Notation

• Linear Search

• Big Theta Notation

• Big Omega Notation

It is an algorithm that checks each element in a list sequentially until the target element is found.

• Linear Search

• Binary Search

• Bubble Sort

• Merge Sort

It an algorithm that works on a sorted array. It repeatedly divides the search space in half and compares the middle element to the target.

• Linear Search

• Binary Search

• Bubble Sort

• Merge Sort

It is a simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order.

• Linear Search

• Binary Search

• Bubble Sort

• Merge Sort

It is a divide-and-conquer algorithm that divides the list into two halves, recursively sorts each half, and then merges the two sorted halves.

• Binary Search

• Bubble Sort

• Merge Sort

• Quick Sort