Applets for Data Structure and Algorithms

New version CoEDapplets available

	Data Control Structures
	If-Else Item comparison. If-Else-If Small integer calculator. Switch Small integer calculator. While Filling a vector. For (I) Filling a matrix by rows. For (II) Filling a matrix by columns. For (III) Filling an upper triangular matrix. Routine call An 8-bits binary adder. Passing arguments Passing arguments by value and by reference.
Data Structures
Stack Data insertion and removing from a stack data structure. Queue Data insertion and removing form a queue data structure. Linked list Data insertion and removing from a linked list data structure.
Divide and Conquer	Sorting
Maximum and minimum Maximum and minimum values of an integer data vector. Hanoi Tower of Hanoi algorithm (10 discs maximum).	SelectionSort Sorting an integer data vector with selection. QuickSort Sorting an integer data vector with QuickSort. MergeSort Sorting an integer data vector with MergeSort.
Dynamic Programming	BackTracking
Mochila 0/1 The 0/1 knapsack problem. Chained matrix product Optimal matrix chain multiplication.	The 0/1 Knapsack problem Solving the 0/1 knapsack problem. TSP Solving the Travelling Salesperson Problem.
Recursion	Branch and Bound
Recursive enumeration Recursive enumeration.	The 0/1 Knapsack problem Solving the 0/1 Knapsack problem.