/**
* Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org>
* http://mooo.org
* ----------------------------------------------------------------------
*
* LICENSE
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <stdio.h>
#define NUM 7
#define PI 3.141592
int main()
{ int num[NUM] = { 4, 8, 1, 9, 2, 5, 3, };
int i, j, k, temp;
printf("Original: ");
for (i = 0; i < NUM; i++)
printf("%d ", num[i]);
printf("\n");
for (i = 0; i < NUM - 1; i++) {
for ( j = 0; j < NUM - 1; j++) {
if (num[j] > num[j + 1]) {
temp = num[j];
num[j] = num[j + 1];
num[j + 1] = temp;
}
}
}
printf("Sorted: ");
for (i = 0; i < NUM; i++)
printf("%d ", num[i]);
printf("\n");
return 0;
}