Guest User

Untitled

a guest
Jul 17th, 2018
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Pascal 0.85 KB | None | 0 0
  1. program lab6;
  2. type
  3.   Word = string[100];
  4.   List = array [1..64] of Word;
  5.  
  6.   procedure SortWords(var item: List; count:integer);
  7.  
  8.   procedure qs(l, r: integer; var it:List);
  9.   var
  10.     i, j: integer;
  11.     x, y: Word;
  12.   begin
  13.    i := l; j := r;
  14.    x := it[(l+r) div 2];
  15.    repeat
  16.      while it[i] < x do i := i+1;
  17.      while x < it[j] do j := j-1;
  18.      if i<=j then
  19.      begin
  20.        y := it[i];
  21.        it[i] := it[j];
  22.        it[j] := y;
  23.        i := i+1; j := j-1;
  24.      end;
  25.    until i>j;
  26.  
  27.    if l<j then qs(l, j, it);
  28.    if l<r then qs(i, r, it);
  29.   end;
  30.   begin
  31.     qs(1, count, item);
  32.   end;
  33.  
  34. var count:integer;
  35.     wordlist:List;
  36.     i:integer;
  37. begin
  38.  Write('Words count: ');
  39.  Readln(count);
  40.  for i:=1 to count do
  41.    readln(wordlist[i]);
  42.  SortWords(wordlist,count);
  43.  for i:=1 to count do
  44.  write(wordlist[i]+' ');
  45.  readln();
  46. end.
Add Comment
Please, Sign In to add comment