PLEASE FIND THE ANSWER(S) and EXPLANATION
BELOW.
Yes, Individuals and organizations build various data structures
and algorithms to solve real-life problems.
They will use the big-O notation to analyze the problems.
- Specifying the Data Structures
- We can specify the data structure as needed for a particular
problem.
 
- For example, to store several names of the users, we will need
an Array or List Data structure.
- If we use the tree data structure, we can have
no advantage.
 
 
- Also, to store the hierarchical data, we should use the TREE
data structure instead of lists
 
- Different data structures are:
- List
 
- Array
 
- Tree
 
- Graph
 
- Stack
 
- Queue
 
- Tries
 
- Hash Tables etc.,
 
 
 
- Specifying the Algorithms
- We have to use a particular algorithm to have an advantage over
another.
 
- We can use the Binary Search instead of Linear
search to search for an element in a sorted array.
 
- The types of algorithms are:
- Linear Search
 
- Binary Search
 
- Various Sort methods like:
- Bubble sort
 
- Selection sort
 
- Insertion sort
 
- Merge sort
 
- Quicksort etc.,
 
 
 
- Categories of algorithms
- Brute force
 
- Greedy approach
 
- Dynamic programming
 
- Branch and Bound etc.
 
 
 
- Big-O Analysis
- To measure the efficiency of the
algorithm we are using, we have to apply the big-oh analysis.
 
- The time complexity and Space complexity are the two important
Analysis processes.
 
- Example:
 
- We can apply the above master theorem to find the time
complexity.
 
 
