What kind of sort is this ?

Question

1.00/5 (1 vote)

See more:

 int x[] = { 123 , 999 , 456 , 3432 , 12 , 43 , 9 , 67 , 9000 , 12345 , 45678 , 789 , 765 , 321 } ;
    
int x1[] = { 123 , 999 , 456 , 3432 , 12 , 43 , 9 , 67 , 9000 , 12345 , 45678 , 789 , 765 , 321 } ;

  for ( int i=0 ; i<=4 ; i++ ) 
    {
      int c=0  ; 

     for ( int k=0  ; k<10 ;k++)
      {
      for ( int a=0 ; a<x.length ; a++ )
      {
          if ( ( x1[a] / ( (int)( Math.pow(10,i) ) ) ) %10 == k ) 
          {        
   
             x[c] = x1[a] ;                  

 System.out.println(x[c] + "      " + c );                
           c++ ;  
          }                                     
        }
      
      }
    
     for ( int u=0 ; u<x1.length  ; u++ )
    {
      x1[u] = x[u] ;       
    }

    }

What I have tried:

I was trying to implement radix sort and ended up with this in first try . I removed the temporary array since it is not required when I checked carefully . Is it a good algorithm and what kind of sort is it ?

Posted 10-Jan-18 6:05am

Member 13616463

Updated 10-Jan-18 10:06am

Add a Solution

1 solution

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)

Patrice T · Answer 1 · 2018-01-10T10:03:00

Learn to indent properly your code, it show its structure and it helps reading and understanding. It also helps spotting structures mistakes.

Java

int x[] = { 123 , 999 , 456 , 3432 , 12 , 43 , 9 , 67 , 9000 , 12345 , 45678 , 789 , 765 , 321 } ;
int x1[] = { 123 , 999 , 456 , 3432 , 12 , 43 , 9 , 67 , 9000 , 12345 , 45678 , 789 , 765 , 321 } ;
for ( int i=0 ; i<=4 ; i++ )
{
  int c=0  ;
  for ( int k=0  ; k<10 ;k++)
  {
    for ( int a=0 ; a<x.length ; a++ )
    {
      if ( ( x1[a] / ( (int)( Math.pow(10,i) ) ) ) %10 == k )
      {
        x[c] = x1[a] ;
        System.out.println(x[c] + "      " + c );
        c++ ;
      }
    }
  }
  for ( int u=0 ; u<x1.length  ; u++ )
  {
    x1[u] = x[u] ;
  }
}

Professional programmer's editors have this feature and others ones such as parenthesis matching and syntax highlighting.
Notepad++ Home[^]
ultraedit[^]

Quote:
Is it a good algorithm and what kind of sort is it ?

It look like a radix sort but highly inefficient.