From a3e8ad2bd26763d25306343c7dff818c70b1842b Mon Sep 17 00:00:00 2001 From: "Kelvin S. do Prado" Date: Sun, 12 Nov 2023 20:24:49 -0300 Subject: [PATCH] Remove unused pascal directory --- src/pascal/bubble-sort.pas | 99 ----------------------------- src/pascal/busca-binaria.pas | 66 ------------------- src/pascal/fatorial-recusiva.pas | 26 -------- src/pascal/fatorial.pas | 19 ------ src/pascal/heapsort.pas | 98 ----------------------------- src/pascal/mergesort.pas | 105 ------------------------------- src/pascal/pilha.pas | 68 -------------------- src/pascal/selectsort.pas | 96 ---------------------------- 8 files changed, 577 deletions(-) delete mode 100644 src/pascal/bubble-sort.pas delete mode 100644 src/pascal/busca-binaria.pas delete mode 100644 src/pascal/fatorial-recusiva.pas delete mode 100644 src/pascal/fatorial.pas delete mode 100644 src/pascal/heapsort.pas delete mode 100644 src/pascal/mergesort.pas delete mode 100644 src/pascal/pilha.pas delete mode 100644 src/pascal/selectsort.pas diff --git a/src/pascal/bubble-sort.pas b/src/pascal/bubble-sort.pas deleted file mode 100644 index 5419c41f..00000000 --- a/src/pascal/bubble-sort.pas +++ /dev/null @@ -1,99 +0,0 @@ -program selection_sort; - -{dia 06/05 -Version: 0.5 -Nome: Wellington De Souza Silva -Método : Selection Sort} - -// bug com dois valores altos ??? - -uses crt; - -const - MAX = 10; - -type - Tdado = integer; - - Tvetor = array[1..MAX] of Tdado; - -var - vetor : Tvetor; - -//usado para tester -procedure preencher(var vetor : Tvetor); -begin - vetor[1] := 4; - vetor[2] := 3; - vetor[3] := 500; - vetor[4] := 7; - vetor[5] := 10; - vetor[6] := 1309; - vetor[7] := 8; - vetor[8] := 9; - vetor[9] := 2; - vetor[10] := 6; -end; - -procedure manual(var vetor:Tvetor); -var - i : integer; -begin - for i := 1 to MAX do - begin - writeln('informe o valor ',i); - readln(vetor[i]); - end; -end; -// acha o menor, nucleo do programa -procedure kernel(var vetor : Tvetor); -var - j: integer; - temp : integer; -begin - for j:= 1 to MAX do - begin - if vetor[j] > vetor[j+1] then - begin - temp := vetor[j]; - vetor[j] := vetor[j+1]; - vetor[j+1] := temp; - end; - end; -end; - -////////////////////////////// -procedure exibir(vetor: Tvetor); -var - i : integer; -begin - writeln; - write(' | '); - for i:=1 to MAX do - begin - write(vetor[i]); - write(' | '); - end; - writeln; -end; - -procedure repetir(); -var - i: integer; -begin - for i:=MAX downto 1 do - begin - kernel(vetor); - exibir(vetor); - end; -end; - -begin - preencher(vetor); - writeln('Vetor Original'); - exibir(vetor); - repetir(); - writeln; - writeln('Vetor Ordenado'); - exibir(vetor); -end. \ No newline at end of file diff --git a/src/pascal/busca-binaria.pas b/src/pascal/busca-binaria.pas deleted file mode 100644 index 328a8e47..00000000 --- a/src/pascal/busca-binaria.pas +++ /dev/null @@ -1,66 +0,0 @@ -program buscabinaria; - -const - MAX = 30000; - -type - Tdado = integer; - Tvetor = array[1..MAX]of integer; - Tarq = text; -var - vetor : Tvetor; - valor: Tdado; - -procedure preencher(var vetor : Tvetor); -var - i : integer; -begin - for i:= 1 to MAX do - begin - vetor[i] := i; - end; -end; - -procedure buscaBinariarec(vetor:Tvetor; valor:Tdado; inicio:integer; fim:integer); -var - meio : integer; -begin - meio := (inicio+fim) div 2; - - { - writeln; - writeln('--------------------------------'); - writeln('Passo a Passo'); - writeln('valor ',vetor[meio]); - writeln('posicao ',meio); - writeln('--------------------------------'); - writeln; - } - - if(valor = vetor[meio]) then - begin - writeln('Achou!!'); - //writeln('valor ',vetor[meio]); - writeln('posicao ',meio); - end else - if(meio=inicio) then write('error 404') else - begin - if((valor > vetor[meio]) and (meio <> inicio)) then - begin - //writeln('DIREITA'); - buscaBinariarec(vetor, valor, meio, MAX); - end; - - if((valor < vetor[meio]) and (meio <> inicio)) then - begin - //writeln('ESQUERDA'); - buscaBinariarec(vetor, valor, inicio, meio); - end; - end; -end; - -begin - valor := 21054; - preencher(vetor); - buscaBinariarec(vetor, valor, 0, MAX); -end. \ No newline at end of file diff --git a/src/pascal/fatorial-recusiva.pas b/src/pascal/fatorial-recusiva.pas deleted file mode 100644 index 40ca7a82..00000000 --- a/src/pascal/fatorial-recusiva.pas +++ /dev/null @@ -1,26 +0,0 @@ -program fatorial_recursiva; -var - num : longint; - -function fatorial (number : longint): longint; -begin - if (number = 1) then - fatorial := 1 - else - fatorial := number * fatorial(number-1) -end; - -function fatorialb(n:integer): integer; -begin - if n > 1 then - fatorial := fatorial(n-1) * n - else fatorial := 1; -end; - -begin - writeln('Informe um numero'); - readln(num); - writeln(' '); - - writeln(num,'! = ',fatorial(num)); -end. \ No newline at end of file diff --git a/src/pascal/fatorial.pas b/src/pascal/fatorial.pas deleted file mode 100644 index c0708ce4..00000000 --- a/src/pascal/fatorial.pas +++ /dev/null @@ -1,19 +0,0 @@ -program fatorial_pascal; -var - num, cont, soma : longint; -begin - soma := 1; - cont := 0; - writeln('Informe um numero'); - readln(num); - writeln(' '); - - for cont := num downto 2 do - begin - //writeln(num*num-1); - writeln(soma); - soma := soma*cont; - writeln(soma); - end; - writeln(num,'! = ',soma); -end. \ No newline at end of file diff --git a/src/pascal/heapsort.pas b/src/pascal/heapsort.pas deleted file mode 100644 index 245f7a2c..00000000 --- a/src/pascal/heapsort.pas +++ /dev/null @@ -1,98 +0,0 @@ -program HeapSort240616; - -const - MAX = 10; - -type - Tgiven = integer; - Tvector = array[0..MAX] of Tgiven; - -var - vector : Tvector; - -procedure auto(var vector:Tvector); -var - i : integer; -begin - for i := 0 to MAX-1 do - begin - vector[i]:=random(150); - end; -end; - -procedure display( vector: Tvector ); -var - i: integer; -begin - writeln; - write('=> | '); - for i := 0 to MAX-1 do write(vector[i],' | '); - writeln; -end; - -procedure swap( var a, b: integer ); -var - temp: integer; -begin - temp := a; - a := b; - b := temp; -end; - -procedure sink( var vector : Tvector; start, last: integer ); -var - root, child: integer; -begin - root := start; - while ( root * 2 + 1 <= last ) do begin - child := root * 2 + 1; - if ( child < last ) and ( vector[child] < vector[child + 1] ) then - child := child + 1; - if ( vector[root] < vector[child] ) then begin - swap ( vector[root], vector[child] ); - root := child; - end else - break; - end; -end; - -procedure heighten( var vector : Tvector; count: integer ); -var - start: integer; -begin - start := (count - 1) div 2; - while ( start >= 0 ) do - begin - sink (vector, start, count-1); - start := start - 1; - end; -end; - -procedure heapSort( var vector : Tvector; lastVector:integer ); -var - last : integer; -begin - heighten(vector, MAX ); - last := MAX - 1; - writeln; - writeln('Heap'); - display(vector); - while ( last > 0 ) do - begin - swap(vector[last], vector[0]); - last := last - 1; - sink(vector, 0, last); - end; -end; - -//program -begin - writeln; - auto(vector); - writeln('Original Vector'); - display(vector); - heapSort (vector, MAX); - writeln; - writeln('Sorted Vector'); - display(vector); -end. \ No newline at end of file diff --git a/src/pascal/mergesort.pas b/src/pascal/mergesort.pas deleted file mode 100644 index bf78762c..00000000 --- a/src/pascal/mergesort.pas +++ /dev/null @@ -1,105 +0,0 @@ -program mergeSort; - -const - MAX = 10; - SENTINELA = 3200; - -type - Tdado = integer; - - Tvetor = array[1..MAX] of Tdado; - TvetorSentinela = array[1..MAX+1] of Tdado; - -var - vetor : Tvetor; - -procedure auto(var vetor:Tvetor); -var - i : integer; -begin - for i := 1 to MAX do - begin - vetor[i]:=random(150); - end; -end; - -procedure exibir(vetor: Tvetor); -var - i : integer; -begin - writeln; - write(' | '); - for i:=1 to MAX do - begin - write(vetor[i]); - write(' | '); - end; - writeln; -end; - -procedure merge(var vetor:Tvetor; inicio:integer; meio:integer; fim:integer); -var - e, d, i : integer; - esquerda : integer; - direita : integer; - left : TvetorSentinela; - right : TvetorSentinela; - -begin - //final de cada vetor temporario - esquerda := (meio - inicio +1); - direita := (fim - meio); - // vetor temporario recebendo seus valores respectivos - for e := 1 to esquerda do - left[e] := vetor[inicio+e-1]; - for d := 1 to direita do - right[d] := vetor[meio+d]; - //para determinar qtos trocas - left[esquerda+1] := SENTINELA; - right[direita+1] := SENTINELA; - - e := 1; - d := 1; - //unir(merge) os vetores os ordena-os - for i := inicio to fim do - begin - // qual lado e maior q o outro - if (left[e] <= right[d]) then - begin - vetor[i] := left[e]; - e := e+1; - end else - begin - vetor[i] := right[d]; - d:= d+1; - end; - end; -end; - -procedure dividir(var vetor : Tvetor; inicio:integer; fim:integer); -var - meio : integer; -begin - //merge - //write('merge'); - //writeln; - //writeln(inicio); - //writeln(fim); - if (inicio < fim) then - begin - meio := (inicio+fim) div 2; - //esquerda - dividir(vetor, inicio, meio); - //direita - dividir(vetor, meio+1, fim); - //chama o merge, após termina as recursões acima. - merge(vetor,inicio, meio, fim); - end; -end; - -begin - auto(vetor); - exibir(vetor); - dividir(vetor, 1, MAX); - exibir(vetor); -end. \ No newline at end of file diff --git a/src/pascal/pilha.pas b/src/pascal/pilha.pas deleted file mode 100644 index 3612d2d3..00000000 --- a/src/pascal/pilha.pas +++ /dev/null @@ -1,68 +0,0 @@ -program exe_pilha; -const - MAX = 3; -type - Tvetor = array[1..MAX] of integer; -var - pilha : Tvetor; - condicao : char; - posicao, valor : integer; - -procedure push (valor : integer); -begin - if(posicao>MAX) then writeln('OverFlow') else - begin - posicao := posicao + 1; - pilha[posicao] := valor; - end; -end; - -function pop : integer; -begin - if(posicao<1) then writeln('UnderFlow') else - begin - pop := pilha[posicao]; - posicao := posicao - 1; - end; -end; - -procedure exibir; -begin - writeln('___________________________________ '); - - writeln('Posicao na pilha :'); - for posicao:=1 to MAX do - begin - writeln('Indice: ',posicao, ' = ',pilha[posicao]); - end; - writeln('___________________________________ '); - - writeln('Posicao na pilha a se retirada :'); - for posicao:=MAX downto 1 do - begin - writeln('Indice: ',posicao, ' = ',pilha[posicao]); - end; -end; - -begin - posicao := 0; - - repeat - writeln('Deseja [A]dicionar , [R]etirar ou [S]air ?'); - readln(condicao); - - case condicao of - 'A','a' : begin - writeln('Valor '); - readln(valor); - push(valor); - end; - - 'r','R' : begin - writeln('O valor = ',pop); - end; - end; - until(condicao = 's') or (condicao = 'S'); - - exibir; -end. \ No newline at end of file diff --git a/src/pascal/selectsort.pas b/src/pascal/selectsort.pas deleted file mode 100644 index 6eef0dc4..00000000 --- a/src/pascal/selectsort.pas +++ /dev/null @@ -1,96 +0,0 @@ -program selection_sort; - -uses crt; - -const - MAX = 10; - -type - Tdado = integer; - - Tvetor = array[1..MAX] of Tdado; - -var - vetor : Tvetor; - -//usado para tester -procedure preencher(var vetor : Tvetor); -begin - vetor[1] := 4; - vetor[2] := 3; - vetor[3] := 500; - vetor[4] := 7; - vetor[5] := 10; - vetor[6] := 1309; - vetor[7] := 8; - vetor[8] := 9; - vetor[9] := 2; - vetor[10] := 6; -end; - -procedure manual(var vetor:Tvetor); -var - i : integer; -begin - for i := 1 to MAX do - begin - writeln('informe o valor ',i); - readln(vetor[i]); - end; -end; -// acha o menor, nucleo do programa -procedure kernel(var vetor : Tvetor; pos : integer); -var - aux : integer=0; - j: integer; - menor : integer; -begin - menor := pos; - for j:= pos+1 to MAX do - begin - if vetor[menor] > vetor[j] then - begin - menor := j; - - end; - end; - - aux := vetor[pos]; - vetor[pos] := vetor[menor]; - vetor[menor] := aux; -end; - -////////////////////////////// -procedure exibir(vetor: Tvetor); -var - i : integer; -begin - writeln; - write(' | '); - for i:=1 to MAX do - begin - write(vetor[i]); - write(' | '); - end; - writeln; -end; - -procedure repetir(); -var - i: integer; -begin - for i:=1 to MAX-1 do - begin - kernel(vetor,i); - end; -end; - -begin - manual(vetor); - writeln('Vetor Original'); - exibir(vetor); - repetir(); - writeln; - writeln('Vetor Ordenado'); - exibir(vetor); -end. \ No newline at end of file