All Classes and Interfaces

Class	Description
AgentsTasks	BRANCH AND BOUND PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS
AgentsTasks	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program can solve the problem using two greedy algorithms and test operation.
AgentsTasksDifferentSizesTimes	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program serves to increase the size of the execution times of the problem and to check the quadratic behavior expected O(n^2)
AgentsTasksRandomValues	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program serves to randomly generate a matrix of costs (the size is introduced by the user).
AgentsTasksTimes	BACKTRACKING PROBLEM: THE PROBLEM OF ASSIGNING N TASK TO AGENTS This program can solve the problem using a backtracking algorithm
ArrayDequeExample	Demonstrates ArrayDeque as both a queue (FIFO via add/poll) and a stack (LIFO via push/pop).
ArrayListExample	Demonstrates basic ArrayList operations: add, remove, and iteration.
BidirectionalBubble	Sorting algorithm: Bidirectional Bubble method
BinaryInsertion	Sorting algorithm: Binary Insertion method
BinarySearch	Binary Search implementation for finding an element in a sorted array.
BranchAndBound	Main class to solve problems using the Branch and Bound technique We need to extend it for any specific problem
BranchAndBoundThreads	Main class to solve problems using the Branch and Bound technique We need to extend it for any specific problem
Bubble	Bubble Sort Algorithm - Educational Sorting Implementation.
Change	Coin Change Problem — Dynamic Programming solution.
Change	GREEDY ALGORITHM PROBLEM: THE PROBLEM OF THE CHANGE OF MONEY It has an optimal solution in some cases.
ChessHorse	GREEDY ALGORITHM PROBLEM: THE HORSE JUMPING PROBLEM (Knight's tour) It has not an optimal solution in some cases
ChessHorseAll	BACKTRACKING PROBLEM: THE HORSE JUMPING PROBLEM The program calculates all the ways of moving a horse through an entire chessboard of side n
ChessHorseOne	BACKTRACKING PROBLEM: THE HORSE JUMPING PROBLEM This program calculates all the ways of moving a horse through an entire chessboard of side n
ChessHorseSimpleHeuristic	GREEDY ALGORITHM PROBLEM: THE HORSE JUMPING PROBLEM (Knight's tour) It has not an optimal solution in some cases
ChessQueensAll	BACKTRACKING PROBLEM: THE PROBLEM OF THE N QUEENS This program calculates one way of placing n queens on a chessboard of side n
ChessQueensOne	BACKTRACKING PROBLEM: THE PROBLEM OF THE N QUEENS This program calculates one way of placing n queens on a chessboard of side n
Combinations	DYNAMIC PROGRAMMING PROBLEM: MATHEMATICAL COMBINATIONS n x k The recursive algorithm that calculates Combinations has exponential complexity and repeats calculations already performed.
DirectInsertion	Sorting algorithm: Direct insertion method
DirectSelection	Sorting algorithm: Direct selection method
EightPuzzle	BRANCH AND BOUND PROBLEM: THE PUZZLE
Factorial	DIVIDE AND CONQUER PROBLEM: CALCULATE THE FACTORIAL OF A NUMBER
Factorial	To calculate the factorial of a number
Fibonacci	Fibonacci Number Calculation using Divide and Conquer and Iterative Approaches.
Fibonacci	DYNAMIC PROGRAMMING: CALCULATE THE FIBONACCI NUMBER OF ORDER n Fibonacci Series = 0,1,1,2,3,5,8,13,21,34,55,89,... e.g. the 0 is when n=0 and the 89 is when n=11
FibonacciAlgorithm	To solve the classical Fibonacci algorithm using a recursive and inefficient algorithm
FibonacciTask	To calculate the Fibonacci of a number n
FilesDisc1	GREEDY ALGORITHM PROBLEM: MAXIMIZE THE NUMBER OF FILES ON A DISK It has an optimal solution.
FilesDisc2	GREEDY ALGORITHM PROBLEM: MINIMIZE THE FREE SPACE ON A DISK WITH FILES It has NOT an optimal solution in some cases.
GCG	GREATEST COMMON DIVISORS: Calculate the GCG of two positive integers
GetAdditionFromList	To get the addition of a list of numbers
GetMaximumFromList	To get the maximum of a list of numbers
HashSetExample	Demonstrates HashSet operations: add, remove, and contains.
Heap	To save and sort the nodes that are going to be used
Heapsort	Sorting algorithm: Heapsort method
HeapThreads	To save and sort the nodes that are going to be used
HelloWorld	Just to show a small example of how the project is structured
ImprovedBubble	Sorting algorithm: Bubble method with sentinel
ISortingAlgorithm	Interface for sorting algorithms
Knapsack	GREEDY ALGORITHM PROBLEM: THE KNAPSACK PROBLEM (BREAKABLE) it has an optimal solution
Knapsack01	0/1 Knapsack Problem - Dynamic Programming Solution.
Knapsack01	GREEDY ALGORITHM PROBLEM: THE KNAPSACK PROBLEM (0/1).
LinkedHashSetExample	Demonstrates LinkedHashSet operations.
LinkedListExample	Demonstrates LinkedList as a doubly-linked list with operations at both ends: addFirst, addLast, removeFirst, and removeLast.
MajoritarianElement	//DIVIDE AND CONQUER PROBLEM: IS THERE A MAJORITARIAN ELEMENT IN n ELEMENTS?
MaxPairWiseProduct	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 However, in this example we will only work with two integer numbers
MaxPairWiseProduct2	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 However, in this example we will only work with two long numbers
MaxPairWiseProduct3	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 We will load the numbers from MaxPairWiseProductRandomNumbers.txt
MaxPairWiseProduct4	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 We will load the numbers from MaxPairWiseProductRandomNumbers.txt
MaxPairWiseProduct5	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 We will load the numbers from MaxPairWiseProductRandomNumbers.txt
MaxPairWiseProduct6	Computes the max pairwise product among different numbers E.g.: 7 3 6 => 42 We will load the numbers from MaxPairWiseProductRandomNumbers.txt
MaxPairWiseProductRandomNumbers	Generates a test data file of random integers for the MaxPairWiseProduct problem.
MaxSum	DIVIDE AND CONQUER PROBLEM: MAXIMUM SUMMATION OF ALL THE SUBSEQUENCES OF n ELEMENTS
Median	//DIVIDE AND CONQUER PROBLEM: THE MEDIAN OF n ELEMENTS
Mergesort	Mergesort algorithm using divide-and-conquer.
Mode	//DIVIDE AND CONQUER PROBLEM: MODE OF n ELEMENTS
Node	To represent the different states of a problem in the graph For each problem, we should extend this class with specific information We also need to compare Nodes because it is the way to compare them in the priority queue
Permutations	BACKTRACKING PROBLEM: PERMUTATIONS OF N ELEMENTS This program generates permutations of the integer elements that are in the vector v
PermutationsTimes	BACKTRACKING PROBLEM: PERMUTATIONS OF N ELEMENTS This program calculates times to generate the permutations of n elements.
Plumber	Single-plumber scheduling utility.
PriorityQueueExample	Demonstrates PriorityQueue with natural ordering.
Quicksort	Quicksort sorting algorithm.
Radix	Sorting algorithm: Radix method
RectanglesPlacement	BRANCH AND BOUND PROBLEM: OPTIMAL PLACEMENT OF RECTANGLES
RectanglesPlacementThreads	BRANCH AND BOUND PROBLEM: OPTIMAL PLACEMENT OF RECTANGLES
RecursiveActionComparison	To calculate the cube root of the values of an array
RecursiveActionSquare	To calculate the square of the values of an array
RecursiveTaskSum	To calculate the addition of the values of an array
RiverTravel	DYNAMIC PROGRAMMING PROBLEM: CHEAPER TRAVEL ON THE RIVER It consists on finding the minimum cost for each pair of points
Search	To use different methods for searching numbers in an array
SequentialSearch	DIVIDE AND CONQUER PROBLEM: CALCULATE THE POSITION OF AN ELEMENT x IN A VECTOR (SORTED OR UNSORTED) OF n DIFFERENT ELEMENTS
Shellsort	Sorting algorithm: Shellsort method
SomePlumbers	GREEDY ALGORITHM PROBLEM: SOME DILIGENT PLUMBERS It has an optimal solution
StackExample	Demonstrates the legacy Stack class (LIFO) with push and pop operations.
SubsetsGivenSum	BACKTRACKING PROBLEM: SUBSETS OF A GIVEN SUM This program, given a set consisting of n different positive integers, computes all subsets which sum a given value c
TreeSetExample	Demonstrates TreeSet with natural sorted ordering.
Util	Utility class for divide-and-conquer sorting helpers.
Util	Helper class to trace and use common operations among sorting algorithms
VectorExample	Demonstrates the legacy thread-safe Vector collection.
VectorSum	DIVIDE AND CONQUER PROBLEM: CALCULATE THE SUM OF n ELEMENTS IN A VECTOR
WorkerThread	Worker thread for the parallel Branch and Bound search.