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


JavaScript Programming

JavaScript > Code Examples

A Looping Array Lookup





Check a Number can be Expressed as Sum - Program to check whether a number can be expressed as sum of two prime numbers. To accomplish this task, "checkPrime()" function is created. The "checkPrime()" returns 1 if the

C Convert Binary to Octal Number System - In C program user is asked to enter the binary number and the program then converts that binary number to the octal number by calling a user defined function. To understand this...

C Implementing Selection Sort Recursively - This C Program implements a Selection Sort. 'Selection Sort' works by finding the smallest unsorted item in the list and swapping it with the item in the current position. It is used for

C Program Code Merge Two Sorted Array - C program to read elements in two array and merge elements of two array into third array. Elements of array can be merged either in ascending order or in descending order in C.

C Compute the Sum of Digits in an Integer - C Program take the integer as input. Divide the input integer by 10, obtain its remainder and quotient. Increment the new variable with the remainder got at step 2. Repeat the

Add Two Matrix Using Multi-Dimensional - In this program, user is asked to entered the number of rows r & columns c. The value of r & c should be less than 100 in this program. Then, the program adds these two matrices,

Built-in Data Types in C++ Programming - Any programming language has built in data types. Data types are used to create variables or your new data types. Variable is a amount of memory that has its own name and value.

C++ Program to Implement Ternary Tree - C++ program implements the ternary tree, is a tree data structure in which each node has at most three "child nodes", distinguished as "left", "mid" and "right". Nodes with children