Subversion Repositories Kolibri OS

Rev

Rev 3043 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2568 leency 1
//Быстрая сортировка. Leency 2008.
2
 
3
void Sort_by_Size(int a, b)   // для первого вызова: a = 0, b = <элементов в массиве> - 1
4
{
3043 leency 5
	int iss = a;
2568 leency 6
	IF (a >= b) return;
7
	FOR (j = a; j <= b; j++)
3043 leency 8
		IF (ESDWORD[file_mas[j]*304 + buf+64] <= ESDWORD[file_mas[b]*304 + buf+64])	{ file_mas[iss] >< file_mas[j];   iss++;}
9
	Sort_by_Size (a, iss-2);
10
	Sort_by_Size (iss, b);
2568 leency 11
}
12
 
13
 
14
void Sort_by_Name(int a, b)   // для первого вызова: a = 0, b = <элементов в массиве> - 1
15
{
3043 leency 16
	int isn = a;
2568 leency 17
	IF (a >= b) return;
18
	FOR (j = a; j <= b; j++)
3043 leency 19
		IF (strcmp(file_mas[j]*304 + buf+72, file_mas[b]*304 + buf+72)<=0) { file_mas[isn] >< file_mas[j];   isn++;}
20
	Sort_by_Name(a, isn-2);
21
	Sort_by_Name(isn, b);
2568 leency 22
}
23
 
3157 leency 24
 
2568 leency 25
void Sort_by_Type(int a, b)   // для первого вызова: a = 0, b = <элементов в массиве> - 1
3157 leency 26
{
27
	dword filename1, filename2, ext1, ext2;
28
	int n, isn = a;
2568 leency 29
	IF (a >= b) return;
3157 leency 30
	for (j = a; j <= b; j++)
2568 leency 31
	{
3157 leency 32
		filename1 = file_mas[j]*304 + buf+72;
33
		filename2 = file_mas[b]*304 + buf+72;
3043 leency 34
 
3157 leency 35
		n=strlen(filename1)-1;
36
		WHILE (n>0) && (ESBYTE[filename1+n]<>'.') n--;
37
		IF (n) ext1 = filename1+n+1; else ext1=0;
38
		n=strlen(filename2)-1;
39
		WHILE (n>0) && (ESBYTE[filename2+n]<>'.') n--;
40
		IF (n) ext2 = filename2+n+1; else ext2=0;
41
 
42
		n=strcmp(ext1, ext2);
43
		IF (n<0) { file_mas[isn] >< file_mas[j];   isn++;}
44
		IF (n==0) && (strcmp(filename1, filename2)<=0) { file_mas[isn] >< file_mas[j];   isn++;}
2568 leency 45
	}
3157 leency 46
	Sort_by_Type(a, isn-2);
47
	Sort_by_Type(isn, b);
2568 leency 48
}
49