Subversion Repositories Kolibri OS

Rev

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

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