files-programs/len_line_srt_0pt.c at master · cosmicquark8/files-programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
///sort stringlengthwise in file..
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct rc
{
int r;
int c;
};

struct rc lengthy(FILE *fp)
{
	int c=0,c1=0,f=0;
	char ch;
	struct rc r1;

	while( (ch=fgetc(fp))!=-1 )
	{
		c++;
		if(ch=='\n')
		{
			f++;
			if(c>c1)
				c1=c;
			c=0;
		}
	}
	r1.r=f;
	r1.c=c1;
	return r1;
}
//////////////////////////////////////////////
void sort(char **p,struct rc c)
{
int i,j;
char t[100];
//struct rc c;

	for(i=0;i<c.r-1;i++)
	{
		for(j=i+1;j<c.r;j++)
		{
			if( strlen(p[i])>strlen(p[j]) )
			{
				strcpy(t,p[i]);
				strcpy(p[i],p[j]);
				strcpy(p[j],t);
			}
		}
	}
/*	for(i=0;i<c.r;i++)
	{
		printf("%s",p[i]);
	}*/

}
//////////////////////////////////////////////
void main(int argc,char **argv)
{
	int sz,i,j,n,r=0,stat;
	char ch,**p,t[100];
	FILE *fp;
	struct rc c;

	if(argc!=2)
	{
		printf("\nOperand missing.\n");
		return;
	}

	fp=fopen(argv[1],"r");

	if(fp==0)
	{
		printf("File is missing.\n");
		return;
	}

	c=lengthy(fp);
//	printf("r=%d\nc=%d\n",c.r,c.c);

	rewind(fp);

	fseek(fp,0,SEEK_END);
	sz=ftell(fp);
//	printf("wsize=%d\n",sz);

//	t=malloc(sizeof(char *)*c.c);

	p=malloc(sizeof(char *)*c.r);
	for(j=0;j<c.r;j++)
	{
		p[j]=malloc(sizeof(char)*c.c);
	}

	rewind(fp);

	char **q=p;
//	i=0;
//	while( fgets(p[i],c.c+1,fp) )
	while( fgets(*q,sz,fp) )
	{
//	i++;
	q++;
	}
/*
	for(i=0;i<c.r;i++)
		fgets(p[i],c.c+1,fp);*/

/*	for(i=0;i<c.r;i++)
	{
		printf("%s",p[i]);
	}	*/
	sort(p,c);
fp=fopen(argv[1],"w");

for(j=0;j<c.r;j++)
stat=fputs(p[j],fp);

if(stat>0)
printf("\n\e[32mFile's strings are sorted sucsessfully.\e[m\n");
else
printf("\n\e[33mOperation failed..\e[m\n");

//while( fgets(*q,sz,fp) )
//fputs(*p,fp);
}