REVERSING Numbers

[mediaskare]

#include<stdio.h>
#include<conio.h>

main()
{

int enter[20],input;
int i,j,t;

printf("Enter How Many Number : ");
scanf("%d",&input);


for( i=0;i<=input-1;i++)
{ printf("\nInput %d : ",i+1);
scanf("%d",&enter[i]);
}
printf("\nNumber Input are : ");
for( i=0;i<=input-1;i++)
{ printf("\t %d",enter[i]); }


for(i=input-2;i>=0;i--){
for(j=0;j<=i;j++){
if(enter[j]<enter[j+1])
{
t=enter[j];
enter[j]=enter[j+1];
enter[j+1]=t;
}
}
}
printf("\n\nSorted is: ");
for( i=0;i<=input-1;i++)
{ printf("\t %d",enter[i]); }
getch();

}

[mediaskare]

UP TANI PARA SA MGA CLASSMATES SA DATA STRUCTURE !!! \m/

[kamahak]

Unsa ni? Assignment?

Unsay expected output?

[fixyourself]

classmate, mana ka sa assignment?.. ako mana ko tara akoa ai...

#include <conio.h>
#include <stdio.h>
#include <stdlib.h>

#define FALSE 0
#define TRUE 1

int main(int* array, int count, int isReverse)
{
  int numCount = 0;
  int* container = NULL;

  if(isReverse != TRUE && isReverse != FALSE)
  {
	  main(NULL, 0, FALSE);
	  getch();
	  return 0;
  }

  if (array != NULL && count < 1)
    return 0;

  if (array == NULL)
  {
	  printf("Number Count:>");
	  scanf("%d", &numCount);
	  container = (int*) malloc(numCount*sizeof(int));
	  return main(container, numCount, 0) + main(container, numCount, TRUE);
  }

  if (isReverse == TRUE)
  {
    printf("\n%d", array[count - 1]);    
	return main(array, count - 1, TRUE);
  }
  
  main(array, count - 1, isReverse);
  printf("Input item %d:>", count);
  scanf("%d", & array[count - 1]);
  return 0;
}

[mediaskare]

input

1 2 3 4 5

output

5 4 3 2 1

hehe ako g post dri kay d pde USB sa amo school , and block ang facebook. hahahh. and mga email.. heheh

[fixyourself]

input

1 2 3 4 5

output

5 4 3 2 1

hehe ako g post dri kay d pde USB sa amo school , and block ang facebook. hahahh. and mga email.. heheh

classmate, ok ra nko imo copyhon ako answer..

[mediaskare]

na pass nmn nko classm8 nxt time mangayo ko nmo answer hahhaha... thx

[fixyourself]

na pass nmn nko classm8 nxt time mangayo ko nmo answer hahhaha... thx

wai blema na classmate. bsta siguroa lang kasabot ka g unsa..

[kamahak]

Pseudo:

Input:  n
(1) Initialize m = 0
(2) Loop while n > 0
     (a) Multiply m by 10 and add remainder of num
          divide by 10 to rev_num
               m = m*10 + n%10;
     (b) Divide n by 10
(3) Return m

In effect:

int reverser(int n)
{
    int m = 0;
    while(n > 0)
    {
        m = m*10 + n%10;
        n /= 10;
    }
    return m;
}

tada! recursive solution! O(log(n)) ftw!

[fixyourself]

haha... tan awn nato bai, dawaton ba sa iyang maestra atong mga solution. haha