Selection Sort Program - Revision history

Arjun Suresh at 11:24, 22 July 2014

2014-07-22T11:24:12Z

Arjun Suresh at 11:23, 22 July 2014

2014-07-22T11:23:26Z

Arjun Suresh at 11:23, 22 July 2014

2014-07-22T11:23:00Z

Arjun Suresh at 10:02, 22 July 2014

2014-07-22T10:02:11Z

Arjun Suresh at 09:56, 22 July 2014

2014-07-22T09:56:32Z

Arjun Suresh at 09:52, 22 July 2014

2014-07-22T09:52:21Z

Arjun Suresh: Created page with "Complexity and no. of swaps required ==Recursive solution== void selection_s..."

2014-07-22T09:50:54Z

Created page with "Complexity and no. of swaps required ==Recursive solution== <syntaxhighlight lang="c" name="selectionsort_rec"> void selection_s..."

New page

[[Complexities_of_Basic_Sorting_Algorithms |Complexity and no. of swaps required]]
==Recursive solution==
<syntaxhighlight lang="c" name="selectionsort_rec">

void selection_sort(int *a, int n)
{
if(n == 1)
return;
int big = 0, i;
for(i = 1; i < n; i++)
{
if(a[i] > a[big])
{
big = i;
}
}
/*swap a[n-1] and a[big]*/
int temp = a[n-1];
a[n-1] = a[big];
a[big] = temp;
selection_sort(a, n-1);
}

int main()
{
int a[100], i, n;
printf("Enter n:");
scanf("%d", &n);
printf("Enter numbers: ");
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
selection_sort(a, n);
prntf("Printing sorted:\n");
for(i = 0; i < n; i++)
printf("%d ", a[i]);
return 0;
}

</syntaxhighlight>

{{Template:FBD}}

[[Category: Arrays]]

← Older revision		Revision as of 11:24, 22 July 2014
Line 83:		Line 83:

	[[Category: Arrays]]		[[Category: Arrays]]
		+	[[Category: Sorting]]

← Older revision		Revision as of 09:56, 22 July 2014
Line 1:		Line 1:
		+	<metadesc>Selection sort program in C using recursion</metadesc>
	[[Complexities_of_Basic_Sorting_Algorithms \|Complexity and no. of swaps required]]		[[Complexities_of_Basic_Sorting_Algorithms \|Complexity and no. of swaps required]]
	==Recursive solution==		==Recursive solution==

@@ Line 38: / Line 38: @@
 </syntaxhighlight>
-<!--
 ==Non-Recursive solution==
 <syntaxhighlight lang="c" name="selectionsort_rec">
@@ Line 79: / Line 79: @@
 </syntaxhighlight>
--->
 {{Template:FBD}}
 [[Category: Arrays]]

@@ Line 3: / Line 3: @@
 ==Recursive solution==
 <syntaxhighlight lang="c" name="selectionsort_rec">
 void selection_sort(int *a, int n)
@@ Line 40: / Line 41: @@
 ==Non-Recursive solution==
 <syntaxhighlight lang="c" name="selectionsort_rec">
 void selection_sort(int *a, int n)
+{
-        if(n == 1)
+         int big, i, j;
          for(i = 0; i < n; i++)
-−
+        {
-        for(i = 1; i < n; i++)
+                big = 0;
-                if(a[i] > a[big])
+                for(j = 1; j < n-i; j++)
-                        big = i;
+                        if(a[j] > a[big])
+                                big = j;
-        /*swap a[n-1] and a[big]*/
-        int temp = a[n-1];
+                /*swap a[n-1] and a[big]*/
-        a[n-1] = a[big];
+                int temp = a[n-i-1];
-        a[big] = temp;
+                a[n-i-1] = a[big];
-         selection_sort(a, n-1);
+                a[big] = temp;
+}
@@ Line 69: / Line 71: @@
                  scanf("%d", &a[i]);
          selection_sort(a, n);
-         prntf("Printing sorted:\n");
+         printf("Printing sorted:\n");
          for(i = 0; i < n; i++)
                  printf("%d ", a[i]);
          return 0;
+}
 </syntaxhighlight>