mirror of
https://github.com/KolibriOS/kolibrios.git
synced 2024-12-19 21:32:34 +03:00
340 lines
4.8 KiB
C
340 lines
4.8 KiB
C
|
|
|||
|
///===========================================
|
|||
|
///
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
///
|
|||
|
///
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD> algolist.manual.ru
|
|||
|
///
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20>. <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> aka Albom (albom85@yandex.ru)
|
|||
|
///===========================================
|
|||
|
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> int (4 <20><><EFBFBD><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
void qsi(int *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
int temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsi(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsi(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> short int (2 <20><><EFBFBD><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qss(short *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
short temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qss(a, j);
|
|||
|
if ( n > i )
|
|||
|
qss(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> char (1 <20><><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qsc(char *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
char temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsc(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsc(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> unsigned int (4 <20><><EFBFBD><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
void qsui(unsigned *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
unsigned temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsui(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsui(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> unsigned short int (2 <20><><EFBFBD><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qsus(unsigned short *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
unsigned short temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsus(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsus(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> unsigned char (1 <20><><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qsuc(unsigned char *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
unsigned char temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsuc(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsuc(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> float (4 <20><><EFBFBD><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qsf(float *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
float temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsf(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsf(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
/// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> double (8 <20><><EFBFBD><EFBFBD>)
|
|||
|
///===========================================
|
|||
|
|
|||
|
void qsd(double *a, int n)
|
|||
|
{
|
|||
|
|
|||
|
int i, j;
|
|||
|
double temp, p;
|
|||
|
|
|||
|
p = *(a+(n>>1));
|
|||
|
|
|||
|
i = 0;
|
|||
|
j = n;
|
|||
|
|
|||
|
do
|
|||
|
{
|
|||
|
while ( *(a+i) < p ) i++;
|
|||
|
while ( *(a+j) > p ) j--;
|
|||
|
|
|||
|
if (i <= j)
|
|||
|
{
|
|||
|
temp = *(a+i);
|
|||
|
*(a+i) = *(a+j);
|
|||
|
*(a+j) = temp;
|
|||
|
i++;
|
|||
|
j--;
|
|||
|
}
|
|||
|
} while ( i<=j );
|
|||
|
|
|||
|
if ( j > 0 )
|
|||
|
qsd(a, j);
|
|||
|
if ( n > i )
|
|||
|
qsd(a+i, n-i);
|
|||
|
|
|||
|
}
|
|||
|
|
|||
|
///===========================================
|
|||
|
|
|||
|
|
|||
|
#define NULL ((void*)0)
|
|||
|
|
|||
|
typedef struct
|
|||
|
{
|
|||
|
void *name;
|
|||
|
void *function;
|
|||
|
} export_t;
|
|||
|
|
|||
|
char szQsi[] = "qsi";
|
|||
|
char szQss[] = "qss";
|
|||
|
char szQsc[] = "qsc";
|
|||
|
char szQsui[] = "qsui";
|
|||
|
char szQsus[] = "qsus";
|
|||
|
char szQsuc[] = "qsuc";
|
|||
|
char szQsf[] = "qsf";
|
|||
|
char szQsd[] = "qsd";
|
|||
|
|
|||
|
export_t EXPORTS[] =
|
|||
|
{
|
|||
|
{ szQsi, (void*) qsi },
|
|||
|
{ szQss, (void*) qss },
|
|||
|
{ szQsc, (void*) qsc },
|
|||
|
{ szQsui, (void*) qsui },
|
|||
|
{ szQsus, (void*) qsus },
|
|||
|
{ szQsuc, (void*) qsuc },
|
|||
|
{ szQsf, (void*) qsf },
|
|||
|
{ szQsd, (void*) qsd },
|
|||
|
{ NULL, NULL },
|
|||
|
};
|