Thut ton n gin nht trong lp trnh

1.Bi ton sai s.

Mc ch :
- Nhp vo mt gi tr v n l iu kin dng vng lp v ta khng bit chc rng
n s chy bao nhiu vng l dng.
While(iu kin)
{ ng th thc hin}
- Cn lu ti mi quan h gia t v mu hoc t vi t hoc t mu vi gi tr
chy ca vng lp.
V d :
Thut ton tnh ex vi mi lin quan t v mu
- T l gi bnh phng ca x.
- Mu l gi tr tch mu vi gi tr chy i.
Code :
Input c,x;
t=m=1; ex=0=i; //Khi to t=m=1 v hm tnh tng ex=0
While(math.abs(t/m)>c) //Kim tra iu kin ng th thc hin lnh
{
ex=ex+t/m; // Tnh gi tr ln u tin vi i=0. V ln sau t,m s c thay th
i=i+1;

// Sau tang ln tnh cc ln sau

t=t*x;

// Tnh gi tr t

m=m*i;

// Tnh gi tr mu

2.c chung ln nht v bi chung nh nht

Mc tiu :
- c l s b chia a/b c l b. Bi l s chia chnh l a

Thut ton
- So snh hai s a v b . Tm hiu hai s cho ti khi chng bng nhau
Code
Public static int UCLN(int a,int b)
While(a!=b)

If(a>b) a=a-b;
else b=b-a; }
return a
}
BCNN l a*b/UCLN(a,b)

3.Bi ton chuyn t h 10 sang mt h bt k

Mc tiu :
- Nm quy tc chuyn ly s chia cho s cn chuyn
- Vi h 16 phi in ra k t ch [65-A,97-a ] c th in ra (a,b,c,d,e,f)
Thc hin
- Cn so snh xem s no ln hn
- Sau c chia ly nguyn ri li ly li s chia li ln na cho ti khi ra
- Mi ln chia in ra mt ln.
Code
Public static void Doicoso(int a,int b)

if(a>=b) Doicoso(a/b,b); // C mi ln s cha mt s d v ly s nguyn chia li

if(a%b>9) System.out.print(%c,a%b+55); //Trng hp d ln hn 10 khi i 16
else
System.out.printf(a%b);
}
Note :

- Mi dung debug cho ta kt qu. C ti Doicoso n li lu bin vo b m cho ti

khi a<b th mi thi.
- Sau n s chy if v in ra kt qu ln u
- Sau quay li Doicoso v chy li cc bin cn li t if th hai.

4.Bi ton v tng cc phn t

Mc tiu
- Cn tnh tng cc phn t khi nhp vo
- Sau mi ln tnh th cn tch s cui ra.
Thc hin
- Vi 10 ta c th
+ Tch bt i s cui /10 ly nguyn [1234/10=123]
+ Tch ly phn d php tnh [1234/10=4]
- Vy tng c tnh bng tng cc s d
Code
Public static void sum(int a)

int s=0,x;
while(a!=0)
{
y=a%10;

// Tch ly s cui

a=a/10;

//Bt s cui ca dy s ban u

s=s+y;

//Sau tnh tng tng s cui

}
}

5. Bi ton tch mt s thnh cc tha s nguyn t

Mc tiu :
- Cn bit mt s tch ra th lun c cc s nguyn t nu theo nguyn tc phi
chia ht cho 2 ch i khi no khng chia ht cho 2 mi bt u tang ln.
Thut ton

- Xt cho s a chia ht cho hai vng lp chy v iu kin dng l s =1.

- S nguyn t l s t nhin>0 chia ht 1 v chnh n
Code :
Int i=2;
While(a>1)
{
if(a%i==0) n=n/i;
else i++;
}

6.Bi ton in ra n s nguyn t u tin.

Mc tiu :
- Cn tm c s l s nguyn t
Thut ton
- Mt l chng minh s l nto
- Sau tang dn cho ti n dng
Code
(1).Nto
Public static boolen nto(int a)

if(a<2) return flase;

else

{
for(i=2;i<=math.sqrt(a);i++)
if(a%i==0) return flase;
return true;
}
}

(2). In ra cc s nguyn t nh hn n.
Int i;
for(i=2;i<=n;i++)
if(nto(i))
system.out.print( + i);
(3.1). In ra n s nguyn t
- Cn c mt bin m kim tra xem ng l bng n cha
int dem=0,i=2;
while(dem!=n)
{
if(nto(i))
{
system.out.print(i)
dem++;
}
else
i++;
}

(3.2) Cch 2
- Do ta bit vng lp nn s dng for vi iu kin dng l dem<=n
Int dem=0,i;
for(i=2;dem<=n;i++)
{

if(nto(i))

system.out.print( + i)
dem++;
}
}

7.Bi ton in ra mt danh sch bt k

Vn :
- Cho mt danh sch sinh vin v sau in ra theo :
+ Tng hoc gim dn th n simple
String > < [ <a>compare(<b>) >0 int (>0 or <0) ]
String = [ a.equal(b) boolean (True or Flase) ]
float (a-b>0)
+ Tm kim Simple
String (a.equal(b))
+ Danh sch theo mt i tng khc
Coder thc hin code
[ for1 [a] for2 ]
- Dng hm for chy ht lun, nhng c hai hm for nh check iu kin
- For1 (Kim tra nu m s [a] xut hin tc equal = true ) khi thc hin
tng gi tr i=i+1 v b qua [a]
Continue label; nhy ti ch gn label.
- For2 Sau khi for1 tha mn th thc hin for2
L in ra nhng th m bi cn in.
CODE
label: for(int i=0 ; i<sv.lenght ; i++)
{
for(int j=0 ; j < i ; j++)
if(sv[i].getLop()equal(sv[j].getLop()))
continue label; //Nu ng l bng th b qua v sinh vin c in for2 // //
// tng i=i+1
System.out.print(Danh sach sinh vien lop +sv[i].getLop() );

for(int j=i ; j < sv.length ; j++) // Chy nt cc gi tr cn li

{
if(sv[i].getLop().equal(sv[j].getLop()))
sv[i].outPut; //output l hm puplic vit trong mt lp khc in ra thng tin s.v
}
}