Happy Codings - Programming Code Examples

JavaScript Programming

JavaScript > Code Examples

A string array



A string array

<html>
<body>

<script type="text/javascript">
var nameArray = new Array("Name 1","Name 2","Name 3","Name 4","Name 5","Name 6")

for (i=0; i<nameArray.length; i++){
    document.write(nameArray[i] + "<br>")
}
</script>

<p>
Happy Codings :-) JavaScript Code Examples
<br>
</p>

</body>
</html>

Any number of Digits Armstrong Sample
An "Armstrong Number" is a number that is the 'sum of its own digits' each raised to the power of the number of digits is equal to the number itself. Some Armstrong numbers is 0

Program Prints Natural Numbers in Range
Using above logic you can easily find a way to print natural numbers in range. If not here is a hint. Input start limit from user and store it in some variable say start. Input end limit from

Shortest Path Between two Vertices Using
This is a C++ Program to check whether path exists between two given nodes. The idea is to run the 'Depth First search' algorithm with the given source node, if during 'dfs' we visit

Program Input and Print elements in array
C coding to input elements in array and print array. How to input and display elements in an array using for loop in C programming. How to input and display array elements in

C++ Find Maximum & Minimum Numbers
Program should display all 'random elements' of array and minimum and maximum number in array on screen. Array size is fixed to 100 to change the size just change the 'Value of size'

C++ Checks the Alphabets is Vowel or Not
To check whether the input alphabet is vowel or not a vowel in C++, Enter a Character, then check the character for Vowel. The character is vowel, only if it's equal to a, A, e, E, i, I, o, O

C Convert Binary to Hexadecimal Number
C Program to input binary number from user and convert to hexadecimal number system. Binary Number System is a base 2 number system. Binary number system use only two

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