This section covers Java Programming Examples on Combinatorial Problems & Algorithms. Every example program includes the description of the program, Java code as well as output of the program.
Here is the listing of Java programming examples:
1. Java Programming examples on “Sorting”
The section contains programs on implementing sorting algorithms like radix, bucket, bubble, selection, quick, shell, merge, insertion, heap, counting, shaker and stooge sort.
2. Java Programming examples on “Searching”
The section contain programs that implement searching algorithms like interpolation, ternary, binary, srquential, self organizing lists, multi threaded version of binary search tree, locality of reference and interpolation search, divide and conquer, evaluating largest, smallest and peak elements using these algorithms, and computing the number of occurrences using various algorithms.
3. Java Programming examples on ” Median and Selection”
The programs compute median and mode of different elements in an array, smallest and largest numbers in an array and implements quick sort algorithm with complexity constraints.
4. Java Programming examples on “Generating Permutations”
The section contains programs that generate permutations using alexander bogomolny, heap algorithm and from possible combinations of a given list of numbers.
5. Java Programming examples on “Generating Subsets”
The section contains programs to generate subsets in gray code, lexico graphic, binary counting, coin flipping methods.
6. Java Programming examples on “Generating Partitions”
The programs in this section generates integer partitions, random partitions and performs operations on them.
|
Java Program to Perform integer Partition for a Specific Case Java Program to Generate All the Set Partitions of n Numbers Begining from 1 and so on Java Program to Generate Random Partition out of a Given Set of Numbers or Characters Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself |
7. Java Programming examples on “Generating Graphs”
The section contains programs on generating graphs using different methods like prufer code, edge flipping, adjacency matrix and list, incidence matrix and list, 2D arrays and linked lists.
8. Others
The programs in this section implement miscellaneous other algorithms like gale shapley, floyd cycle, brent cycle, k way merge and food fill algorithm.
