º»¹®/³»¿ë
¸® Æ÷ Æ®
Á¦¸ñ : Sorting Program
°ú¸ñ : µ¥ÀÌÅͱ¸Á¶2
±³¼ö :
Çаú :
Çйø :
¼º¸í :
1. Diagram
2. ÇÔ¼ö ¼³¸í
¢º ÆÄÀÏÀ» ÀоîµéÀÌ´Â °Í°ú °ü·ÃµÇ´Â ÇÔ¼öµé
1) ch-ar trim(ch-ar s)
: °ø¹éÀ» Á¦°ÅÇÏ´Â ¸ÞÀÎ ÇÔ¼öÀ̸ç, right_trim(), left_trim(), center_trim()ÇÔ¼ö¸¦ Â÷·Ê·Î ½ÇÇà½Ã۸ç, °ø¹éÀÌ Á¦°ÅµÈ ¹®ÀÚ¿À» ¸®ÅÏ ÇÑ´Ù.
2) void right_trim(ch-ar s)
for (i¡ësizeof(s)-1;i`0;i)
{
if (s[i]` ` || s[i]`£Ün`) s[i]¡ë0x00;
else break;
}
: ¿À¸¥ÂÊ °ø¹éÀ» Á¦°ÅÇÏ´Â ÇÔ¼öÀÌ´Ù.
- iÀÇ ÃʱⰪÀ» strlen(s)-1·Î ÇØÁØ ÀÌÀ¯ : ¹è¿Àº 0ºÎÅÍ ½ÃÀÛÇϹǷΠ½ÇÁ¦ ¹®ÀÚ¿ÀÇ ³¡Àº s[strlen(s)-1] ºÎÅÍÀ̱⠶§¹®ÀÌ´Ù.
- ¹®ÀÚ¿ÀÇ ¸¶Áö¸·¿¡¼ºÎÅÍ ½ÃÀÛÇØ¼ °ø¹éÀ̳ª ¶óÀΰ³Ç๮ÀÚ°¡ ³ª¿Ã¶§±îÁö ±× ºÎºÐÀ» ³Î¹®ÀÚ(0x00)À¸·Î ¹Ù²ãÁ༠°ø¹é°ú ¶óÀΰ³Ç๮ÀÚ¸¦ ¾ø¾ÖÁØ´Ù.
3) ch-ar left_trim(ch-ar s)
for (i¡ë0;i`strlen(s);i++)
{
if(s[i]!¡ë` `) break;
}
return s+i;¡¦(»ý·«)
4) ch-ar center_trim(ch-ar s);
b_duin