C中的幾個常用演算法
阿新 • • 發佈：2019-01-02
/*一般查詢法*/
{
int i;
if( size <= 0 )
return -1;
for( i = 0; i < size; ++i )
if( date == array[i] )
return i;
return -1;
}
void swap( int *pa, int *pb )/*交換*/
{
if( (pa == NULL) || (pb == NULL) )
return ;
int temp;
temp = *pa;
*pa = *pb;
*pb = temp;
}
void m_sort( int array[],int begin, int end ) /*一般排序法*/
{
int i;
if( begin >= end )
return ;
for( i = begin + 1; i <= end; ++i )
if( array[ begin ] > array[i] )
swap( &array[ begin ], &array[i] );
m_sort( array, ++begin, end );
}
void q_sort( int array[],int begin, int end )
{
int i;
if( size <= 0 )
return -1;
for( i = 0; i < size; ++i )
if( date == array[i] )
return i;
return -1;
}
void swap( int *pa, int *pb )/*交換*/
{
if( (pa == NULL) || (pb == NULL) )
return ;
int temp;
temp = *pa;
*pa = *pb;
*pb = temp;
}
void m_sort( int array[],int begin, int end ) /*一般排序法*/
{
int i;
if( begin >= end )
return ;
for( i = begin + 1; i <= end; ++i )
if( array[ begin ] > array[i] )
swap( &array[ begin ], &array[i] );
m_sort( array, ++begin, end );
}
void q_sort( int array[],int begin, int end )