lnsp

var JSL = JSL || {};
JSL.HashMap = function () {
    "use strict";
    var keys = [],
        values = [];
    function indexOf(key) {
        var i = 0;
        if (keys.indexOf !== undefined) {
            return keys.indexOf(key);
        }

lnsp

bool isPrimeNumber(const int n) {
	for (int i = 2; i < n; i++) {
		if (n % i == 0)
			return false;
	}
	return true;
}

lnsp

bool isPalindrom(const int n) {
	int temp = n, reversed = 0;

	while (temp != 0) {
		int rem = temp % 10;
		reversed = reversed * 10 + rem;
		temp /= 10;
	}

	return reversed == n;

lnsp

def collatz(x):
    z = 0
    while x != 1:
        if x % 2 == 0:
            x /= 2
        else
            x = x * 3 + 1
        z += 1
    return z

lnsp

import java.util.ArrayList;
import java.util.List;

public class Node<T> {
	private Node<T> parent;
	private List<Node<T>> children;
	private T data;

	public Node(Node<T> parent) {
		this(parent, null);

lnsp

// package [Paketpfad]
package io.mooxmirror.javakurs2;

// öffentliche Klasse 'HalloWelt'
public class HalloWelt {
	
	// Einstiegsmethode 'main(String[] args)', muss vorhanden sein!
	public static void main(String[] args) {
		// Gebe Text 'Hallo Welt!' aus!
		System.out.println("Hallo Welt!");

lnsp

// A Stack structure implementation
// (c) 2015 mooxmirror

#include <stdlib.h>
#include <stdio.h>

#define STACK_TYPE int
#define STACK_TYPE_NULL 0

typedef struct stack stack;

lnsp

/*
A Stack structure implementation
(c) 2015 mooxmirror
*/

#include <stdlib.h>
#include <stdio.h>

#define STACK_TYPE int
#define STACK_TYPE_NULL NULL

lnsp

/*
A Stack structure implementation
(c) 2015 mooxmirror
*/

#include "stack.h"

Stack * Stack_create()
{
	Stack * s = (Stack *) malloc(sizeof(Stack));

lnsp

public static void sort(int[] a) {
	int largestNumber = 0;

	// find largest number
	for (int n : a)
		if (largestNumber < n) largestNumber = n;

	// calculate needed iterations
	final int maxIterations = (int) Math.log10(largestNumber) + 1;