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>

Collection of Sorting & Selection Routines
Shellsort, using Shell's (poor) increments. An Internal method for heapsort. i is the index of an item in the heap. Returns the index of the left child. Internal method for heapsort that is

Find the Sum of All Nodes in a Binary Tree
Program code to find the sum of all nodes in a binary tree. Structure to create the binary tree. Inserting elements in the binary tree. C Code to dynamically create new nodes. Code

Simple Queue Programs in C++ Language
The "queue? size?" function would return the length of the line, and the ?empty? function would return true only if there was nothing in the line. "Simple Queue" C++ Example, array

C++ Programs to Implement Skew Heap
Inserting element "into the heap". Deleting "maximum element" from the heap. Merge two heaps. Print the 'maximum element' of the heap. And merge the present heap with

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++ Implements Queue Using Two Stacks
Program to implement queue using stacks. n this method, in en-queue operation, the new element is entered at the top of stack1. In de-queue operation, if "stack2" is empty then all

The C++ Implementation for Binary Heap
Capacity is the capacity of the "binary heap". Duplicates are allowed. "Throw Overflow" if container is full. Find the smallest item in the "priority queue". Return the smallest item, or

Binary Search Algorithm & Specific Search
C++ Program to find a search sequence using Binary search. Implement the "binary search" to find the first value of search sequence. It is there, compare remaining item 'Sequentially'