C++ Programming Code Examples

Checks a Character is Capital Letter or Not

Takes input a Character and Check it whether a 'character' is capital letter, small letter, Digit or Special character. 'All characters' like small or capital letters, digits and special characters

Checking Character is Vowel or Consonant

Alphabets a, e, i, o, u are known as vowels. All other alphabets except these 5 alphabets are known are 'consonants'. C++ sample assumes that the user will enter an Alphabet. Similarly

C++ Language & Concatenate Two Strings

Combined two strings means add both string with each other, perform this operation using 'library function' or without library function. If first string is 'john' and second string is porter

C++ language Decode a Message Encoded

This program decodes any message encoded by the technique of traditional playfair cipher. "The Playfair Cipher" is a 'Manual Symmetric' Encryption Technique and was the first literal

Finds the Longest Increasing Subsequence

This is a C++ Program to implement LCS. The longest common subsequence (LCS) problem is to find the "longest subsequence common" to all sequences in a set of sequences. Classic

C++ Codings for Implement Affine Cipher

This C++ Program implement "Affine Cipher". The affine cipher is a type of Monoalphabetic Substitution Cipher, wherein each letter in an alphabet is mapped to its numeric equivalent,

Aho-Corasick Algorithm String Matchings

"Aho-Corasick" string matching algorithm is a 'searching algorithm', it is a kind of dictionary matching Algorithm that locates elements of a finite set of strings (the "Dictionary") within

C++ Bitap Algorithm and String Matching

The algorithm tells whether a text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance and

BoyerMoore & Algorithm String Matching

Whenever the 'character' does not match, we slide the pattern in such a way that aligns the bad character with the last occurrence of it in pattern. We preprocess the pattern and store

C++ language Implements the Hill Cypher

Program to implement hill cipher. In classical cryptography, the Hill cipher is a polygraphic substitution cipher based on 'Linear Algebra'. Following discussion assumes an elementary

C++ Language & Monoalphabetic Cypher

A substitution cipher is a method of encoding by which units of 'plaintext are replaced' with ciphertext, according to a regular system; the "units" may be "single letters", pairs of letters

C++ Language & One Time Pad Algorithm

C++ program encodes any message using the technique of 'One time' pad cipher technique. Input is not Case Sensitive and works only for all characters. 'White Spaces' are not ignored

Program to Implement the RSA Algorithm

Encodes any message using 'RSA Algorithm'. Input is 'Case Sensitive' and works only for all characters. RSA is one of the first practicable 'public-key' cryptosystems and is widely used

String Search Algorithm & Short text sizes

C++ program performs Naive string matching without using any specific library functions. A text and a Pattern is given as input. Pattern is searched for in a text and all 'instances' of the

Cryptography by Transposition Technique

This "C++" Program implement transposition technique. In "Cryptography", a transposition cipher is a method of encryption by which the positions held by units of plaintext (which are

Programs Performs Naive String Matching

C++ Program perform Naive String matching algorithm. "String Searching" algorithm is an important class of string algorithm that try to find a place where one or several strings (also

C++ Strings Matching using String Library

C++ program performs string matching using "String library" of C++. A text and a pattern is given as input. The Pattern is 'searched' for in text and all instances of the pattern are given

C++ Coding Repeatedly Search Same Text

C++ program performs Naive string matching without using any specific library functions. A text and a pattern is given as input. Pattern is 'searched' for in the text and all "instances" of