Solved

how do i sort a file?

Posted on 1998-11-19
8
185 Views
Last Modified: 2010-04-16
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
Comment
Question by:der_23
8 Comments
 

Author Comment

by:der_23
Comment Utility
Please give a clear explaination for this question .(a sample program included would be highly appreciated)
thank you
0
 
LVL 7

Expert Comment

by:Inteqam
Comment Utility
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
 
LVL 3

Accepted Solution

by:
vikiing earned 200 total points
Comment Utility
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
  Incr(Max); Read(chan, Arr[Max]);
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
 
LVL 1

Expert Comment

by:FuzzyLogic
Comment Utility
This is Max-Sort which will take O(n^2).
There are algorithms with complexity of O(n*logn), such as merge sort.
0
What Security Threats Are You Missing?

Enhance your security with threat intelligence from the web. Get trending threat insights on hackers, exploits, and suspicious IP addresses delivered to your inbox with our free Cyber Daily.

 
LVL 3

Expert Comment

by:vikiing
Comment Utility
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
 
LVL 1

Expert Comment

by:FuzzyLogic
Comment Utility
OK.
Actually Quick-Sort is less efficient than merge-sort for "worse case".
However, in *most* cases, it is faster.
0
 
LVL 27

Expert Comment

by:BigRat
Comment Utility

"... 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
 
LVL 3

Expert Comment

by:vikiing
Comment Utility
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

Featured Post

Top 6 Sources for Identifying Threat Actor TTPs

Understanding your enemy is essential. These six sources will help you identify the most popular threat actor tactics, techniques, and procedures (TTPs).

Join & Write a Comment

Marketing can be an uncomfortable undertaking, especially if your material is technology based. Luckily, we’ve compiled some simple and (relatively) painless tips to put an end to your trepidation and start your path to success.
HOW TO: Upload an ISO image to a VMware datastore for use with VMware vSphere Hypervisor 6.5 (ESXi 6.5) using the vSphere Host Client, and checking its MD5 checksum signature is correct.  It's a good idea to compare checksums, because many installat…
Access reports are powerful and flexible. Learn how to create a query and then a grouped report using the wizard. Modify the report design after the wizard is done to make it look better. There will be another video to explain how to put the final p…
Here's a very brief overview of the methods PRTG Network Monitor (https://www.paessler.com/prtg) offers for monitoring bandwidth, to help you decide which methods you´d like to investigate in more detail.  The methods are covered in more detail in o…

771 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

8 Experts available now in Live!

Get 1:1 Help Now