[완료] 흠.. 꽤나 어려운듯한 오름,내림차순 정렬 문제가 발생했습니다.

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
/*
unsigned long hash(char *str)
    {
	unsigned long hash = 0;
	// ... hash collision occurred. abolishing the code
        return hash;
    }
*/
 
static int comp(const void *va, const void *vb)
{
	char* a=(char*)va;
	char* b=(char*)vb;
	int la = strlen(a);
	int lb = strlen(b);
	int len = la>lb?la:lb;
	int diff=0;
	int inumbera=0;
	int inumberb=0;
	int tempa;
	int tempb;
	//bool bfirstnumber=false;
 
	for(int i=0; i<len && diff==0; i++)
	{
		diff = a[i] - b[i];
		if( 0!=diff )
		{
			tempa = (int)(a[i] - '0') ;
			tempb = (int)(b[i] - '0') ;
			bool bai = tempa >= 0 && tempa <= 9 ? true : false;
			bool bbi = tempb >= 0 && tempb <= 9 ? true : false;
 
			if(bai && bbi)
			{
				if(la==len)inumbera = inumbera*10 + tempa;
				if(lb==len)inumberb = inumberb*10 + tempb;
 
				diff=inumbera-inumberb;
 
				//bfirstnumber=true;
			}
			else
			{
				//bfirstnumber=false;
			}
		}
	}
 
	return diff;
}
 
int main(int argc, char* argv[])
{
	int j;
 
	char input[12][10] = {"a1", "a11", "a07", "a21", "au2", "a2", 
				"a111", "a3b", "a3a", "a3a1", "a3a11", "aaa", };
	const int istrings = 12; // number of strings to sort
 
	qsort(&input[0], istrings, 10, comp);
 
	for (j = 0; j < istrings; j++)
		puts(input[j]);
 
	exit(EXIT_SUCCESS);
}