עבודה וראיון עבודה ב , שאלות מראיון עבודה בנושא Algorithms.

max = a1;
for i = 2 to n
if ai > max then max = ai;

function binarySearch(a, value, left, right)
while left ≤ right
mid := floor((right-left)/2)+left
if a[mid] = value
return mid
if value < a[mid]
right := mid-1
else
left := mid+1
return not found

function binarySearch(a, value, left, right)
if right < left
return not found
mid := floor((right-left)/2)+left
if a[mid] = value
return mid
if value < a[mid]
return binarySearch(a, value, left, mid-1)
else
return binarySearch(a, value, mid+1, right)

void main()
{

char c;

if((c = getchar()) != '\n')
{
main();
}
putchar(c);

}

procedure RemoveFromTail():integer
if(this is the Tail)
element = tail->info
if(this is the last item in the list)
Break pointer connection between head and tail to terminate list
release head from memory pool
else
Traverse list until you reach the tail
release tail from memory pool
set tail pointer to previous element if one exists
set tail's pointer to next element to null
end if
return element
else
return 0
end if
end procedure

procedure RemoveFromHead():integer
if(this is the Head)
element = head->info
temp = head
if(this is the last item in the list)
Break pointer connection between head and tail to terminate list
else
set head.next to equal next item in list
end if
release temp from from memory pool
return element
else
return 0
end if
end procedure

procedure AddToTail(element)
if(this is the Tail)
tail->next = new Node(el)
tail = tail->next
endif
else head = tail = new Node(el)
end procedure

procedure AddToHead(element)
head = new Node(element, head)
if(not the Tail)
tail = head
end if
end procedure

unmark all vertices
choose some starting vertex x
mark x
list L = x
tree T = x
while L nonempty
choose some vertex v from front of list
visit v
for each unmarked neighbor w
mark w
add it to end of list
add edge vw to T