작은숲:위키노트/C 언어 예제/문자열 정렬 함수
보이기
/**
* 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.
*/
/**
* str_sort(), str_print()
*
* void str_sort(char *str[], int num)
* 1. 문자열들을 정렬하는 함수이다.
* 2. 정렬하고자 하는 문자열들을 포인터 배열에 저장한다.
* 3. 포인터 배열과 배열을 크기를 함수의 매개변수로 넘겨준다.
*
* void str_print(char *str[], int num)
* 1. 포인터 배열에 저장된 문자열들을 출력하는 함수이다.
*/
#include <stdio.h>
void str_sort(char *str[], int num);
void str_print(char *str[], int num);
int main()
{ char *names= { "Welcome", "to", "Bitcamp", };
int num = 3;
str_print(names, num);
str_sort(names, num);
str_print(names, num);
return 0;
}void str_sort(char *str[], int num)
{ int i, j, k;
char *temp;
for (i = 0; i < num - 1; i++) {
for (j = 0; j < num - 1; j++) {
for (k = 0; str[j][k] != '\0' && str[j + 1][k] != '\0'; k++) {
if (str[j][k] > str[j + 1][k]) {
temp = str[j];
str[j] = str[j + 1];
str[j + 1] = temp;
}
break;
}
}
}
}void str_print(char *str[], int num)
{ int i;
for (i = 0; i < num; i++)
printf("String %d: %s\n", i, str[i]);
}