Trace Table Simulator

Program Code

Step Explanation

ReadyIntro

Enter values for num1 and num2 above, then press Next to step through the algorithm one line at a time.

Simulation Controls

Speed:

Step 0 of —

Trace Table

Step	Call	Line	num1	num2	Condition	Returns	Action
No items to display

Program Code — IsPath

Program Code — Traverse

Adjacency List (AL) — Figure 2

Node	Neighbours (AL[node])
1	2	3	7
2	1	6
3	1	6	7
4	5
5	4
6	2	3
7	1	3

Highlighted row = node currently being examined by Traverse.

Step Explanation

ReadyIntro

Enter a start and end node (1–7), then press Next to step through IsPath and Traverse line by line.

Simulation Controls

Speed:

Step 0 of —

Trace Table

j	Subroutine / Call	i	Line	V[1]	V[2]	V[3]	V[4]	V[5]	V[6]	V[7]	Action
No items to display

Program Code — binary_search

Array — items

search range (first–last) midpoint found

Step Explanation

ReadyIntro

Click ⌨ Set via Popup in the bar above to enter your items array and search_item, then press Next to step through binary_search line by line.

Simulation Controls

Speed:

Step 0 of —

Trace Table

Step	Line	found_index	first	last	midpoint	items[midpoint]	found	return value
No items to display

Program Code — BubbleSort

Array — list

comparing (i and i+1) swapped sorted position

Step Explanation

ReadyIntro

Click ⌨ Set via Popup in the bar above to enter your list, then press Next to step through BubbleSort line by line.

Simulation Controls

Speed:

Step 0 of —

Trace Table

Step	Line	n	swapped	i	list[i]	list[i+1]	temp	list (state)
No items to display

Program Code — Compare

Step Explanation

ReadyIntro

Click ⌨ Set via Popup above to enter String1 and String2, then press Next to trace Compare line by line. MID(string, x, y) returns a string of length y starting at position x from string

Simulation Controls

Speed:

Step 0 of —

Trace Table

Step	Line	String1	String2	Len1	RetFlag	x	Len2	NextChar	New	y
No items to display

🔒 Program 2 — Password Protected

Enter a value