jmhertlein

Server has client's public key already, in a list of trusted public keys
keys are RSA key pairs

client connects
server sends its pubkey
client now using server's pubkey to encrypt all outgoing communications, incoming are still unencrypted
client sends username it wants to authenticate as
server loads trusted pubkey for username
encrypts n securely-randomly-generated bytes, sends over unencrypted connection to client
client uses private key to decrypt

jmhertlein

//Precondition: A is a list of elements, sorted in increasing order
//              P is the root of the binary tree to be created

//Postcondition: P is the root of a binary tree containing all elements in A

procedure mktree(list A, node P)
  if A is empty,
    return

  middle = A.length/2

jmhertlein

buildMaxHeap(data)
	//Precondition: data is an ordered set that contains n elements
	data.heapSize = data.length
	//Loop invariant: the trees rooted at indices in the range [i,n] are max-heaps
	for i=FLOOR(data.length/2) downto 1
		maxHeapify(data, I)
	//Postcondition: data[1] is the root of a tree that is a max-heap

mergeSort(data)
	//Precondition: data is an ordered set of n elements

jmhertlein

var remainingTime := 5

procedure run()
    if(remainingTime <= 0) then
        Bukkit.shutdown()
    else 
        print("Halt in " + remainingTime)
        remainingTime--
end
    

jmhertlein

//let's say we're replacing this:

public MyChatListener extends ChatListener {
    public void onPlayerChat(PlayerChatEvent event) {
        //do something
    }
}

//We'll change it to this:

jmhertlein

//assume we're looking for x.

bool found = false;
Node* temp = head, rm = NULL;

//now we loop through our list looking for a node that holds something == to x
while(temp != null && !found) {
  if(temp->data == x) { //if we find it, set found to true and rm to the node
    found = true;
    rm = temp;