Simple Program...

[MabZiCLe]

Hey guys, can you help me with this? C programming major in Turbo c. LOL


Well, this is my problem.

Create a program that accepts 10 positive integers. The program will group and sort all even and odd numbers. Even numbers will be sorted in ascending while odd numbers will be sorted in descending order. If theres is no even numbers found the program will print "NO even numbers" yet it prints the odd numbers, and sort it vice versa.

Use if statements or loops only.(turbo c)(no arrays or gotoxy() ]
please do help me.....

SAMPLE OUTPUT 1:
Enter 10 integers: 1 2 3 4 5 6 7 8 9 10

DISPLAYS:
even numbers:
+--------------------------+
| 2 4 6 8 10 |
+--------------------------+
odd numbers:
+---------------------------+
| 1 3 5 7 9 |
+---------------------------+
sorted even numbers:
+---------------------------+
| 2 4 6 8 10 |
+---------------------------+
sorted odd numbers:
+---------------------------+
| 9 7 5 3 1 |
+---------------------------+

SAMPLE OUTPUT 2:

ENTER TEN INTEGERS: 2 4 6 8 10 24 12 26 56 90

DISPLAYS:

NO ODD NUMBERS!

EVEN NUMBERS: 2 4 6 8 10 24 12 26 56 90
SORTED EVEN: 2 4 6 8 10 12 24 26 56 90


Thanks MORE POwer!

[MabZiCLe]

hmm..well, if no odd/even numbers? still, it will sort?

[DeMan]

Depending on how you implemented your data structure, it could sort irrelevant of what the actual valueas are (that is, whether they are odd, even or a random mixture of both).
Even with arrays you could use almost any type of sort, but a structure like a linked list (which is reasonably easy to implement) may be more eficient. If you are really keen you could try creating a simple binary tree - a structure which beasically stores, adds and deletes elements in a way that is always sorted (if you really wanted to do some work, you could implement a balanced binary tree, which is space efficient, while still holding all the properties of the binary tree.....)

[tavianator]

I think the best way to do that without using arrays is to have ten ints (i0, i1 ... i9) and instead of loops, just modify each directly. Since you only have to input ten numbers, this will work.

[DeMan]

sorting ten integers in ten variables can become REALLY messy (though not impossible), so I would think you need at least 11 variables (a temporary one is always nice), I'm not entirely sure how

instead of loops, just modify each directly

would work for sorting.....

Of course, one option would be to sort the numbers dynamically as they're entered (we put them all in order irrespective of odd/even and then as needed iterate through all testing if they are odd <or even>). To do this :

entry 1 goes in i1
if entry2 > i1 it goes in i2, else i1 goes in i2 and entry 2 goes in i1 (watch out!!! this can get complex even with temp variables......

TBC

[reon]

You can simply use this method for entering just one number and know it is odd or even


#include<iostre am.h>
#include<conio. h>
void main()
{
clrscr();
int a;
cout<<"Enter a number";
cin>>a;
if(a%2==0)
{
cout<<"Even numbers are :"<<a;
}
else
{
cout<<"\nNo even number";
}


if(a%2!=0)
{
cout<<"odd numbers are :"<<a;
}
else
{
cout<<"\nNo odd numbers";
}
getch();
}