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>

Program to calculate Average of array in C
This C program should give an insight of how to parse (read) array. We shall use a loop and Sum up all Values of the array. Then we shall divide the sum with the number of elements

Check If a Given Number is Prime Number
Program takes a number and checks whether a given number is Prime or not. Take number as Input & Check if the number is Divisible by any of the natural numbers starting from 2. If

Checks the Connectivity of Directed Graph
Add Edge to connect "v" and "w". A recursive function to print BFS starting from s. Returns reverse ('or transpose') of this graph. Check if graph is connected. Print graph is connected.

C Codes Multiply 2 Numbers use Function
Create a user defined function product() that multiplies the numbers that we are passing to it during function call. This c function returns the product of these numbers. To understand

Convert Decimal to Octal in C++ language
To convert decimal number to octal number in C++ programming, you have to ask to the user to enter the decimal number to convert it into octal number to display the equivalent

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

Program code to search for a Palindrome
C Programming language code to search for a palindrome. Please enter a word, phrase or sentence below(type END to exit the program). String is a palindrome or it is not...

Finds the Largest clique in a Planar Graph
This is a C++ Program to find the "cliques" of size k in a a graph. An "undirected graph" is formed by a finite set of vertices and a set of unordered pairs of vertices, which are called