Selection sort in descending order

Question

1.00/5 (1 vote)

See more:

C++

#include<iostream.h>


(main) void
{
        int i, j, first, temp;
      int numLength = num.length( );
        for (i= numLength - 1; i > 0; i--)
      {
              first = 0;
              for (j=1; j<=i; j++)
             {
                      if (num[j] < num[first])
                      first = j;
             }
            temp = num[first];
         num[first] = num[i];
         num[i] = temp;
     }
     return;
}

[edit]Code block added, HTML encoded - OriginalGriff[/edit]

Posted 8-Jan-13 8:21am

wazir ahmad

Updated 12-May-20 19:27pm

CPallini

v4

Add a Solution

Comments

Richard C Bishop 8-Jan-13 14:23pm

This is not a question. Elaborate on your issue and explain what you are trying to accomplish. Then, form a specific question on what you need help with.

OriginalGriff 8-Jan-13 14:23pm

This is not a good question - we cannot work out from that little what you are trying to do.
Remember that we can't see your screen, access your HDD, or read your mind.
You seem to have forgotten to tell us what your problem is...
Use the "Improve question" widget to edit your question and provide better information.

wazir ahmad 8-Jan-13 14:35pm

i need slection sort example plz share who its work

4 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Romik Majumder · Answer 1 · 2020-05-12T19:28:00

My code to sort an array in descending order by selection sort:-
.
.
.

#include <bits/stdc++.h> 
using namespace std; 
  
void swap(int *xp, int *yp)  
{  
    int temp = *xp;  
    *xp = *yp;  
    *yp = temp;  
}  
  
void selectionSort(int arr[], int n)  
{  
    int i, j, max_idx;  
   
    for (i = 0; i < n-1; i++)  
    {    
        max_idx = i;  
        for (j = i+1; j < n; j++)  
        if (arr[j] > arr[max_idx])  
            max_idx = j;    
        swap(&arr[max_idx], &arr[i]);  
    }  
}  
void printArray(int arr[], int size)  
{  
    int i;  
    for (i=0; i < size; i++)  
        cout << arr[i] << " ";  
    cout << endl;  
}  
  
// Driver program to test above functions  
int main()  
{  
    int arr[] = {64, 25, 12, 22, 11};  
    int n = sizeof(arr)/sizeof(arr[0]);  
    selectionSort(arr, n);  
    cout << "Sorted array: \n";  
    printArray(arr, n);  
    return 0;  
}

CPallini · Answer 2 · 2013-01-08T09:28:00

Your code won't compile, even on the ancient compiler you are using (why don't you use a more modern C++ compiler?).

You probably mean:

C++

#include <iostream.h>

// the selection sort function
void sort(int num[], int numLength);

// usage sample
int main()
{
	int v[] =  {0,7,-5, 10000, 45};
	const int SIZE = sizeof(v)/sizeof(v[0]); 
	sort(v, SIZE);
	for (int i=0; i<SIZE; i++)
		cout << v[i] << " ";
	cout << endl;
}
// sort implementation
void sort(int num[], int numLength)
{
  int i, j, first, temp;
  if ( numLength < 2) return;

  for (i = numLength - 1; i > 1; i--)
  {
    first = 0;
    for (j=1; j<=i; j++)
    {
       if (num[j] < num[first])
	 first = j;
    }
    temp = num[first];
    num[first] = num[i];
    num[i] = temp;
  }

Jibesh · Answer 3 · 2013-01-08T09:21:00

Solution 2

Looks like a homework to me. but google search would list your result.

Check here[^]

Posted 8-Jan-13 9:21am

Jibesh

Christian Graus · Answer 4 · 2013-01-08T08:33:00

Solution 1

This is not a question at all. The one thing I will say is, iostream.h is not C++. Just include iostream without the .h. Apart from that, this is a code dump. If you have a question, edit this post, and ask it. If not, it will be deleted.

Posted 8-Jan-13 8:33am

Christian Graus

Selection sort in descending order

4 solutions

Solution 4

Solution 3

Solution 2

Solution 1

Add your solution here

Preview 0