retagged by
679 views

1 Answer

Best answer
3 votes
3 votes
A) greedy approach...

because at every step you are greedy to find smallest element...
selected by
Answer:

Related questions

21 votes
21 votes
2 answers
1
Kathleen asked Oct 8, 2014
4,952 views
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
5 votes
5 votes
1 answer
2
2 votes
2 votes
2 answers
3
admin asked Mar 31, 2020
8,490 views
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
2,318 views
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming