Another common problem people found is the difficulties of learning computer programming. Game junkies who start showing obsessional behavior by mobile or desktop gaming platform are not supposed to be addicted by the game that offers only entertainment purpose, rather try to play the game with the beneficial theme like educational game (Edu-game) that able to deliver knowledge and learning insight. This condition very concerning with fact that addicted to the game makes people tend to adopt sloth habit and aside from their obligations activities such study or duties responsibilities, especially on current stay at home policy by the government caused by an ongoing global pandemic. Gaming addiction phenomenon has been happened over the years and keeps increasing over time. Termination: The loop terminates when j= n+1 ⇒ A = A = A which since the array remains sorted after each iteration gives A is sorted when the loop terminates (and contains all the original elements) ⇒ the entire original array is sorted.A-star algorithm, compter programming, educational game, role play game, RPG maker MV Abstract Since the array A began sorted, inserting element A into the proper place produces A in sorted order (and contains the first j elements). Maintenance: The outer for loop selects element A and positions it properly into A via the while loop. The proof of correctness is then straightforward: Initialization: Prior to the loop j =2 ⇒ A = A which contains only the A elements (of which there is only one) and since there is only a single element they are trivially sorted. The loop invariant for insertion sort can be stated as follows: At each step, A contains the first j-1 elements in SORTED order. after the last iteration thus producing the desired result Note: This procedure is similar to an inductive proof with a base case and induction step but with added termination criteria. Termination - the loop invariant is true when the loop terminates, i.e. Maintenance - if the loop invariant is true prior to an iteration, then it is still true after the iteration.

Initialization - the loop invariant holds prior to the first iteration.

Then the proof consists of verifying that the algorithm maintains the loop invariant for three conditions: 1. that it will work for any input set, we construct a loop invariant which is a condition that holds for each iteration of the loop (thus the name invariant). Proof of Correctness In order to prove the correctness of an algorithm, i.e.

Insertion Sort All sorting algorithms have the property that given a set of keys: Input: Sequence of numbers Output: Permutation 0 and A > key 6 A = A 7 i = i - 1 8 A = key

Algoritma pemrograman