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

C Programming Code Examples

C > Bitwise Operators Code Examples

C Program to Swap the ith and jth Bits for a 32-Bit Integer

Sort Rows of the Matrix Ascending Order - Program code sorts the rows of the matrix in ascending & columns in descending order. This program accepts matrix. Then sorts the row in an ascending order & the columns in

Types of Loops in The C++ Programming - While Loop: While a given Expression is true it "Repeats the Statement" in the loop body. Before executing the Loop Body it tests the condition for True or False. Do...While Loop:

Code Get Highest Order Set Bit of Number - Highest position of a set bit from left to right in a number is said to be highest order set bit of that number. Highest order set bit of any negative integers is 31. Since, highest order...

Code to Self Balancing Binary Search Tree - Make the "Tree Logically" empty, insert data and get "height of node". Function to max of left/right node, insert data recursively. Rotate binary tree node with left child. Rotate binary

Convert String to Lowercase using strlwr() - C code convert uppercase string to lowercase using 'For Loop'. Internally characters in C are represented as integer value known as 'ASCII' value. Which means if we write a or any other

Program to Implement Sorted Linked List - Program demonstrates the implementation of Sorted linked list to Balanced BST. Counts the number of nodes in linked list. Construct balanced BST and returns root of it. Returns

Lets Learn String Functions in C Language - Find the "Length of str1". Increment count till we reach the Terminating character. Find the "Length of str2". Check that we have enough 'space' for both strings. Copy 2. string to end

Implement Extended Eucledian Algorithm - Program demonstrates the implementation of "Extended Eucledian" Algorithm. For the 'Modular Multiplicative Inverse' to exist, the number & modular must be coprime. Return