• Status: Solved
• Priority: Medium
• Security: Public
• Views: 221

# how do i sort a file?

I don't  know how to sort a file without using a link list.
I want  to copy a file into the array first then sort them by id number.Then copy it back to the original file as a sorted one.
(my file is a student record)
I don't know how to copy a file into an array and then copy its back to the file after sorting it as an array.
0
der_23
1 Solution

Author Commented:
Please give a clear explaination for this question .(a sample program included would be highly appreciated)
thank you
0

Commented:
That means you have to make an array of record , the same record of the file .
Open the file
read it until the end , and add it to the array

the best way here is Insert sort i think.

0

Commented:
Let's supose this record structure:

record
id: integer;
name: string;
end

That's the record of your file. Then, you must define an array with THE SAME type of that, together an auxilliary variable for swapping during sort process. Of course, you must estimate an array size large enough to accomodate the whole file into it, this is, the number of elements of array must (at least) equals the number of records you have in your file.

To load the file into array, you can do:

Max:=0;     <== Integer variable to be used as array index
While Not Eof(chan) do begin
end;

To sort the array:

For i:=1 to Max-1 do
For j:=i+1 to Max do
If Arr[j].Id < Arr[i].Id then begin    Swap elements
Aux:=Arr[i];  Arr[i]:=Arr[j];  Arr[j]:=Aux;
end;

To write back the array to file:

Seek(chan, 0);   <-- Point to beginning of file
For i:=1 to Max do Write(chan, Arr[i]);

0

Commented:
This is Max-Sort which will take O(n^2).
There are algorithms with complexity of O(n*logn), such as merge sort.
0

Commented:
Beside Max-Sort, you also have Quick-sort (much more efficient than former), but QS is too complex to be easily understood.

Anyway, to sort a student's record file of, let's say, no more than a couple of hundreds of records, that sort procedure is good enough to do its job.

After all, Der_23 is not asking for the OPTIMAL process... ;)

0

Commented:
OK.
Actually Quick-Sort is less efficient than merge-sort for "worse case".
However, in *most* cases, it is faster.
0

Commented:

"... but QS is too complex to be easily understood. " - understood by whom?

Just for the record :-

1) Sort-Merge cannot be bettered.
2) Quick-Sort can achieve Sort-Merge in performance
3) Quick Sort is very easy to implement in Pascal and arrays
4) The sort proposed here (which is TOTALLY adequate for the job) is Bubble Sort
0

Commented:
Big Rat:
A recursive procedure such as Q.S. is difficult enough for anybody who asks for help to sort a file, ¿don't you agree?.

I suggested that bubble sort (to be true, that's known as "false bubble sort") because, as you well state, is totally adequate to solve this problem.

0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.