firwanaa / algorithm-quiz2-pseudocode Goto Github PK

// t points to the top of the stack
Algorithm size():
	return t + 1

Algorithm pop():
	if isEmpty() then
		throw EmptyStackException
	else 
	 t <- t -1 
	 return S[t + 1]

Algorithm push(o):
	if t = S.length - 1 then
		signal stack overflow error
	else
		t <- t + 1
		S[t] <- o

S = new Stack()
while not the end of the stack:
	S.push(letter)
while not S.isEmpty():
	print(S.pop())

// if n is size of the word, O(n)

if (S.size >= 2):
	i = S.pop()
	j = S.top()
	S.push(i)

 // Time complexity: O(1)

Algorithm size():
	return sz

Algorithm isEmpty():
	return (sz == 0)

Algorithm enqueue(o):
	if size() = N -1 then
	 signal queue full error
	else
		r <- (f + sz) mod N
		Q[r] <- o
		sz <- (sz + 1)
// r is rear of the Queue, f is the front, sz is stack size, N is array size

Algorithm dequeue():
	if isEmpty() then
		return null
	else o <- Q[f]
		f <- (f + 1) mod N
		sz <- (sz - 1)
		return o

while !S.isEmpty():
	S'.enqueue(S.dequeue())

S = new Stack()
while Q is not empty:
	S.push(Q.dequeue())
while S is not empyt:
	Q.enqueue(S.pop())

Algorithm add(r,e):
	if n = N then:
		return "Array is full"
	if r < n then:
		for i <- n - 1, n -2, ... ,r do:
			A[i+1] <- A[i] // make room for new element (shifting right)
		A[r] <- e
		n <- n + 1
Algorithm remove(r):
	e <- A[r] // e is a temporary variable
	if r < n - 1 then
		for i <- r, r+1, ... ,n-2 do
			A[i] <- A[i+1] // fill in removed element (shift left)

Algorithm InsertAfter(p, e):
	Create new node v
	v.data <- e
	v.pre <- p //link v to predessor
	v.next <- p.next
	(p.next).prev <- v
	p.next <- v
	return v

Algorithm remove(p): 
	t <- p.element //a temporary variable to hold the return value
	(p.prev).next <- p.nxt
	(p.next).prev <- p.prev
	p.prev <- null
	p.next <- null
	return t 

Algorithm inOrder(v):
	if isInternal(v):
		inOrder(leftChild(v))
	visit(v)
	if isInternal(v)
		inOrder(rightChild(v))

Algorithm printExpression(v):
	if isInternal(v)
		print("(")
		inOrder(leftChild(v))
	print(v.elemnt())
	if isInternal(v):
		inOrder(rightChild(v))
		print(")")

Algorithm LCA(T,W,V):
    lca = new Node()
	sv = new Stack()
	sw = new Stack()
	Node temp1 = v
	Node temp2 = w
	while(temp1 != null):
		sv.push(temp1)
		temp1 = T.parent(temp1)
	while(temp2 != null):
		sv.push(temp2)
		temp2 = T.parent(temp2)
	while(!sv.isEmpty && sv.peak() == sw.peak()):
		lca = sv.pop()
		sw.pop()
	return lca

Algorithm distance(T,W,V):
	sv = new Stack()
	sw = new Stack()
	temp1 = new Node()
	temp2 = new Node()
	while(temp1 != null):
		sv.push(temp1)
		temp1 = T.parent(temp1)
	while(temp2 != null):
		sv.push(temp2)
		temp2 = T.parent(temp2)
	while(!sv.isEmpty && sv.peak() == sw.peak()):
		sv.pop()
		sw.pop()
	return (sv.size() + sw.size())