retagged by
6,486 views
6 votes
6 votes

Selection sort algorithm design technique is an example of

  1. Greedy method
  2. Divide-and-conquer
  3. Dynamic Programming
  4. Backtracking
retagged by

3 Answers

6 votes
6 votes

Correct Answer would be A) Greedy Algorithm

Because, In the first iteration we put a pointer in the start of the array. Then next we start searching index of minimum element index in the rest of the array. Then replace the starting pointer value with minimum index value. (Considering the we are sorting in ascending order). Then repeat this process for each element. 

3 votes
3 votes
Selection sort used in divide and conquer technique

Here smallest element replaces 1st element of the array , 2nd smallest element replaces 2nd element and like that all element sorted
3 votes
3 votes

Selection Sort is Brute force Approach

http://faculty.simpson.edu/lydia.sinapova/www/cmsc250/LN250_Weiss/L28-Design.htm#brute

As we move through all the elements of array so greedy is within available elements we select min between 2 elements but we further move to all elements so i think it wont be greedy

Answer:

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
2,318 views
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming
25 votes
25 votes
7 answers
2
khushtak asked Feb 14, 2017
6,937 views
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
11 votes
11 votes
1 answer
3
makhdoom ghaya asked Nov 19, 2016
5,828 views
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
25 votes
25 votes
3 answers
4
go_editor asked Feb 12, 2015
6,917 views
Given below are some algorithms, and some algorithm design paradigms.$$\begin{array}{ll|ll}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divide a...