This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php | |
$a = "Helló"; | |
$b = "Lajos"; | |
// $a[i] = vesszük az 'A' stringet és kiválasztjuk az 'i'-edik karakterét (0-tól indexel), mely jelen esetben 3 | |
// H-0 E-1 L-2 L-3 Ó-4 | |
echo "$a[3]"; | |
//output: l | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Kiválasztás(X[N],T, sorszám) | |
i:=1 | |
Ciklus amyg X[i] nem T tulajdonságú | |
i:=i+1; | |
Ciklus vége; | |
sorszám:=i; | |
Eljárás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Megszámlálás(X[N],T) | |
DB=0; | |
Ciklus i=1-től N-ig | |
Ha X[i] T tulajdonságú, akkor | |
DB=DB+1; | |
Elágazás vége; | |
Ciklus vége; | |
Eljárás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Eldöntés(X[N],T, VAN) | |
i:=0; | |
Ciklus vége; | |
Ha i<=N akkor | |
VAN | |
Elágazás vége; | |
Eljárás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Kiválogatás(X[N],T,Y[M]) | |
számláló:=1; | |
Ciklus i:=1-től N-ig | |
Ha X[i] T tulajdonságú akkor | |
Y[számláló]=X[i]; | |
számláló:==számláló+1; | |
Elágazás vége; | |
Ciklus vége; | |
Eljárás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Minimum_kiválasztás(X[N], min) | |
min=1; | |
Ciklus i=2-től N-ig | |
Ha X[i]<X[min], akkor | |
min=i; | |
Elágazás vége; | |
Ciklus vége; | |
Eljárás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Összegzés(X[N],S) | |
S=0; | |
Ciklus i=1-től N-ig | |
S=S+X[i]; | |
Ciklus vége; | |
Eljárás vége; | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Keresés(X[N],T, sorszám) | |
i:=1; | |
Ciklius amíg i<=N és X[i] nem T tulajdonságú | |
i:=i+1; | |
Ciklus vége; | |
Ha i<=N akkor | |
sorszám:=i; | |
Különben | |
sorszám:=-1; | |
Elágazás vége; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
lista2 = new Array(10, -10, 20, 999, 30, -30); | |
var max = lista2[0]; | |
function maximum(lista, max){ | |
for(let i=0;i<lista.length; i++){ | |
if (lista[i] > max){ | |
max = lista[i]; | |
} | |
} | |
console.log('max: '+max); | |
} |
NewerOlder