Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes

HTML & CSS Web Design

Html Css > Code Examples

Add style to an anchor in a LI tag

Count Even and Odd Elements in an Array - C program to read elements in an array from user and count total number of even and odd elements in the given array. How to find total number of even and odd elements in a given

C Mirror Image of Right Angled Triangles - 'Pyramid program' in C Programming. Mirror image of right angled triangle. "space_count" variable is used as 'Subscript Variable' used in for loop. 'noofspaces' variable is used to keep

C Program Insertion Sort implementations - 'Insertion Sort Algorithm' picks elements one by one & places it to the right position where it belongs in the "Sorted List of Elements". In C program we have "implemented the same"

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,

Sorting Elements in Lexicographical Order - C Language program code 'Sort Elements' in lexicographical order (dictionary order). This program takes 10 words(10 strings) from the user and sorts them in lexicographical order.

C++ Checks if an Undirected Graph is Tree - C++ Program to check whether an undirected 'graph is tree' or not. Graph is tree if it doesn't contain cycles. A recursive function that uses visited[] & parent to detect cycle in subgraph

Program Code to Reverse a Stack without - C program, using iteration, reverses a stack content. Stack here is represented using a linked list. A linked list is an ordered set of data elements, each containing a link to its

C++ Finds Convex Hull of A Set of Points - Program to implement "Jarvis March" to find convex hull. The idea of Jarvis's Algorithm is simple, we start from the 'leftmost point' (or point with minimum x coordinate value) and