Discuss one type of algorithm approach to use. Share one example of when you would use your selected type of algorithm. Explain why the characteristics associated with this algorithm make it a good fit for the example.
Answer (2)
Quick Sort is a sorting algorithm that efficiently arranges data in order. It is particularly suitable for large datasets due to its average time complexity of O(n log n) and in-place sorting capability. This makes it ideal for quickly sorting student names alphabetically in event planning.
;
One type of algorithm approach is the 'greedy algorithm'.
A greedy algorithm is an approach where one makes the most favorable choice at each step, aiming to find a global optimum by focusing on the local optimum choice at each stage.
An example of when to use a greedy algorithm is in the 'Activity Selection Problem'. Suppose you have a list of activities, each having a start and end time. Your goal is to select the maximum number of activities that do not overlap with each other. The greedy algorithm for this problem involves sorting the activities by their end times and then repeatedly selecting the next activity that starts after the previous selected activity finishes.
Why Greedy Algorithm is a Good Fit:
Efficiency: Greedy algorithms can often provide fast and easy-to-implement solutions. In the activity selection problem, once the activities are sorted by end times, the selection process is straightforward.
Local vs. Global Optimum: While greedy algorithms do not always guarantee a global optimum in every problem, for certain problems like the activity selection, they do lead to an optimum solution due to the nature of the problem.
Simplicity: This approach simplifies decision-making by selecting what seems best at each point, which can be advantageous when dealing with problems where a complex overview isn’t feasible.
In essence, the characteristics of the greedy algorithm, such as making optimal local choices and its typically low computational complexity, make it well-suited for problems like the activity selection where these strategies will result in an optimal solution.
