Java Program to Implement Sorted Vector

This is a Java Program to Implement Sorted Vector. Here Sorted vector is implemented using a vector and each inserted element is placed at correct position in the vector by insertion sort. Here is the source code of the Java Program to Implement Sorted Vector. The Java program is successfully compiled and run on a … Read more

advertisement

Java Program to Implement Tree Set

This is a Java program to Implement Tree Set. A set is an abstract data structure that can store certain values, without any particular order, and no repeated values. Here Tree set maintains sorted order. Here is the source code of the Java program to Implement Tree Set. The Java program is successfully compiled and … Read more

advertisement

Java Program to Implement Sparse Vector

This is a Java Program to implement Sparse Vector. Sparse vectors are useful implementation of vectors that mostly contains zeroes. Here sparse vectors consists of (index, value) pairs. Here is the source code of the Java Program to implement Sparse Vector. The Java program is successfully compiled and run on a Windows system. The program … Read more

advertisement

Java Program to Implement Bit Matrix

This is a Java Program to implement Bit Matrix. Here bit matrix is implemented as an array of bit sets. Here is the source code of the Java Program to implement Bit Matrix. The Java program is successfully compiled and run on a Windows system. The program output is also shown below. /** ** Java Program … Read more

advertisement

Java Program to Implement Patricia Trie

This is a Java Program to Implement Patricia Trie. A radix tree (also patricia trie or radix trie or compact prefix tree) is a space-optimized trie data structure where each node with only one child is merged with its child. Here is the source code of the Java Program to Implement Patricia Trie. The Java … Read more

advertisement

Java Program to implement Bi-Directional Map

This is a Java Program to implement Bi Directional Map. A bi-directional map is an associative data structure in which the (key, value) pairs form a one-to-one correspondence. Thus the binary relation is functional in each direction: value can also act as a key to key. A pair (a, b) thus provides a unique coupling … Read more

advertisement

Java Program to Implement Bit Set

This is a Java Program to implement Bit Set. Bit Set is an array data structure used to implement a simple set data structure. Here is the source code of the Java Program to implement Bit Set. The Java program is successfully compiled and run on a Windows system. The program output is also shown … Read more

advertisement

Java Program to Implement Control Table

This Java program is to implement control table. Control tables are tables that control the control flow or play a major part in program control. There are no rigid rules about the structure or content of a control table—its qualifying attribute is its ability to direct control flow in some way through “execution” by a … Read more

advertisement

Java Program to Implement Vector

This Java program is to Implement Vector. The elements of a vector are stored contiguously.Like all dynamic array implementations, vectors have low memory usage and good locality of reference and data cache utilization Here is the source code of the Java program to implement vector. The Java program is successfully compiled and run on a … Read more

advertisement

Java Program to Implement Trie

This is a Java Program to implement Trie. A trie is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node, instead, its position in the … Read more

advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & technical discussions at Telegram SanfoundryClasses.