QuickSort

Article View: be.comp.programming

Article #16900

Back to be.comp.programming Previous Next

#16900

From: Ares Lagae
Date: Thu, 09 Mar 2000 00:00

28 lines
1465 bytes

Wat is mis met volgend QuickSort Algoritme ?

Vertex is een record met een x en y waarde
de array van vertices worden gesorteerd op x waarde

procedure SortVertices(var VertexArray: TVertexArray; l, r: integer);
var i, j: Integer;
    Vertex: TVertex;
begin
repeat
  i := L;
  j := R;
  Vertex := VertexArray[(L + R) shr 1];
  repeat
    while VertexArray[i].x < Vertex.x do Inc(I);
    while VertexArray[j].x > Vertex.x do Dec(J);
    if i <= j then begin
      Vertex := VertexArray[i];
      VertexArray[i] := VertexArray[j];
      VertexArray[J] := Vertex;
      Inc(I);
      Dec(J);
      end;
  until i > j;
  if l < j then SortVertices(VertexArray, L, j);
  l := i;
until i >= r;
end;

Technical Details

Message-ID: <38C6F13E.957252D8@student.kulak.ac.be>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fcea4,c11e625f32f29b4b,start
X-Google-Attributes: gidfcea4,public
From: Ares Lagae <ares.lagae@student.kulak.ac.be>
Subject: QuickSort
Date: 2000/03/09
Message-ID: <38C6F13E.957252D8@student.kulak.ac.be>
X-Deja-AN: 594947001
Cache-Post-Path: marvin!unknown@pc-10-1-0-089.kulak.ac.be
Content-Transfer-Encoding: 7bit
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: abuse@belnet.be
X-Trace: naxos.belnet.be 952561808 753 134.58.127.3 (9 Mar 2000 00:30:08 GMT)
Organization: KULeuvenNet
X-Cache: nntpcache 2.3.3 (see http://www.nntpcache.org/)
Mime-Version: 1.0
NNTP-Posting-Date: 9 Mar 2000 00:30:08 GMT
Newsgroups: be.comp.programming