Turtle in Circle

I use previous code and improve it so the turtle could only move at certain circle area.

import turtle
from random import uniform
import numpy as np

turtle.shape("turtle")
#turtle.speed(1)
x = 0
y = 0

for i in range (1,1000):
    a = uniform (-90,90) #angle
    turtle.left(a)
    d = uniform (-75,75) #distance
    x += d*np.cos(np.pi*a/180)
    y += d*np.sin(np.pi*a/180)
    r = np.sqrt(x*x+y*y)
    if r>40:
        turtle.setx(0)
        turtle.sety(0)
        x = 0
        y = 0
    turtle.forward(d)

turtle.exitonclick()



 

.

Anti MainStream.

Saat booming sepatu roda, Alfa malah sibuk berlatih skateboard, :D .

Random Turtle Movement.

I use turtle module, the standard module, in Python.

The turtle movement has random direction (angle), and random distance (forward/backward).

import turtle
from random import uniform

turtle.shape("turtle")
turtle.speed(1)
for i in range (1,100):
    #random angle
    a = uniform (-90,90)
    turtle.left(a)
    #random move
    d = uniform (-100,100)
    turtle.forward(d)

turtle.exitonclick()



 

.

The Power of 10

Rules for Developing Safety-Critical Code:

Avoid complex flow constructs, such as goto and recursion.

All loops must have fixed bounds. This prevents runaway code.

Avoid heap memory allocation.

Restrict functions to a single printed page.

Use a minimum of two runtime assertions per function.

Restrict the scope of data to the smallest possible.

Check the return value of all non-void functions, or cast to void to indicate the return value is useless.

Use the preprocessor sparingly.

Limit pointer use to a single dereference, and do not use function pointers.

Compile with all possible warnings active; all warnings should then be addressed before release of the software.

https://en.m.wikipedia.org/wiki/The_Power_of_10:_Rules_for_Developing_Safety-Critical_Code

Prime Number on Python

We've done it using Delphi, how about Python? Easy, :)

for i in range (2,200):
    prime = True
    for j in range (2,i):
        if i%j==0: 
            prime=False
    if prime==True:
        print i

.

Prime Number on Delphi

Using Delphi to generate prime number? Okay, there's some code out there with

if (i mod 2 <>0) and (i mod 3 <>0) and (i mod 5 <>0) and (i mod 7 <>0) then i is prime.

Don't use that.

That's just for prime number below 100.

Use this instead.

var i,j:integer;
   prime:boolean;
begin
  for i:=2 to 200 do begin
    prime:=true;
    for j:=2 to i-1 do begin
      if i mod j=0 then prime:=false;
    end;
    if prime=true then memo1.Lines.Append(intToStr(i));
  end;
end;

.

Rutinitas Sore.

Buka pintu garasi. 

Disambut Alfa Beta.

Memasukkan si ducati sambil dengar mereka cerita tentang hari mereka.

Dikasih sandal sama Beta saat lepas sepatu, sambil dengar rentetan cerita Alfa tentang di sekolah dan di rumah Budhe yang diulang persis sama Beta.

Masuk rumah, mandi, makan sambi baca buku, cerita mereka belum habis.

Kruntelan serumah, diiringi Sophia, Mickey dkk, Kion, Bunga, Beasty, PJ Mask, Captain Jack, ...

Jam tujuh Alfa minta makan, didulang ayah. Beta minta susu dan iPad buat pengantar tidur.

Jam delapan Alfa migrasi dari depan tipi ke kamar, nonton tipi di kasur, semua lampu padam kecuali kamar Beta.

Dan tertidurlah Alfa.

Lampu kamar loteng nyala, sound-mixer nyala, dengan gitar/piano/bass. Main musik sampai ngantuk atau sampai jari bengkak.

Lanjut baca e-book sampai terbangun oleh alarm pagi, :D