Java Small algorithm

1. Array element Switching

A[] A = new A[len]; //len is an int type array length

int index = 0;

A B = a[index++/con%a.length]; //con for controllable switching time

2. Timer Control

Timer timer = new timer ()

int intervel = 10; //time interval 10 milliseconds

int index = 0;

Timer.schedule (New TimerTask () {

public void run () {

//every ten milliseconds

index++;

if (Index%con) {

// 10*con milliseconds per execution

}

},intervel,intervel);

3. Delete any element in the array (used when the element is not sensitive to order)

A[] A = new A[len];

A temp = A[del]; //del to delete an element

A[del] = a[a.length-1];

A[a.length-1]=temp;

A = arrays.copyof (a,a.length-1);

4. Deleting multiple elements in an array

A[] A = new A[len]; //Delete multiple elements in this array

a[] Righta = new A[a.length];

int index = 0;

for (int i=0;i<a.length;i++) {

if (/* Decision condition */) {

Righta[index] = A[i]; //Assign elements that do not need to be removed in order to Righta

index++;

}

}

A = arrays.copyof (Righta,index);

5. Collision Detection

//Judgment (X1,Y1) in a dashed rectangle, i.e. A and B collide

Xborder = x1 + a.width + b.width;

Yborder = y1 + a.height + b.height;

if (X1<xborder && y1<yborder) {

// collision

}

Java Small algorithm