Hello World program in java is the basic example. Simplest java program to print “Hello World”. This is the first program for any programmer in any language. The basic steps of java programming include the following 3 steps: Create the program by typing it into a text editor and saving it to a file named, say, Test.java Compile it by…
What is Function Overloading? When we define one function with more than one definition it is known as Function overloading. For example: int shape(int x); int shape(int x, int y); We can have multiple definitions for the same function name in the same scope. The definition of the function must differ from each other by the types and/or the number of arguments…
What is Tower of Hanoi? All must be well aware of the problem of Tower of Hanoi, for those who don’t know, let’s discuss it once again. The Tower of Hanoi (also called the Tower of Brahma or Lucas’ Tower, and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods, and a number of disks of…
Here is the source code of the program to implement heap C++ programming language. #include <iostream> #include <cstdlib> #include <vector> #include <iterator> using namespace std; // Class Declaration class Heap { private: vector <int> heap; int left(int parent); int right(int parent); int parent(int child); void heapifyup(int index); void heapifydown(int index); public: Heap() {} void Insert(int element); void DeleteMin(); int ExtractMin();…
What is Hash Table Program to implement Hash Tables C++ #include<iostream> #include<cstdlib> #include<string> #include<cstdio> using namespace std; const int TABLE_SIZE = 128; /* * HashEntry Class Declaration */ class HashEntry { public: int key; int value; HashEntry(int key, int value) { this->key = key; this->value = value; } }; /* * HashMap Class Declaration */ class HashMap { private: HashEntry…
Sorting Containers (1) void sort(); (2) template <class Compare> void sort (Compare comp); Sort elements in container: Sorts the elements in the list, altering their position within the container. The sorting is performed by applying an algorithm that uses either operator< (in version (1)) or comp (in version (2)) to compare elements. This comparison shall produce a strict weak ordering…
Priority queue Priority queues are a type of container adaptors, specifically designed such that its first element is always the greatest of the elements it contains, according to some strict weak ordering criterion. This context is similar to a heap, where elements can be inserted at any moment, and only the max heap element can be retrieved (the one at…