Happy Codings - Programming Code Examples

JavaScript Programming

JavaScript > Code Examples

Access window properties

Access window properties

<html>
<head>
<title>Happy Codings :-) JavaScript Code Examples</title>
<script language="JavaScript">
<!--
function showResults(obj, name) {
  document.writeln("<table cellpadding=5 border=1><tr><td align=middle><b><font size=-1>" + name + "</font></b></td></tr>");
  for (i in obj) {
      document.writeln("<td><font size=-1>" + i + "</font></td>");
      document.writeln("</table><p>");
  }
}
showResults(document, "document");
showResults(window, "window");
//-->
</script>
</head>
</html>

C Program Implement BogoSort in Integer - C Code to check if the "array is sorted" or not. Shuffle the "Array Elements" and check if the array is sorted or not & if not sorted calls the shuffle function to shuffle the array elements

Prints the Sum of all Odd Numbers in C++ - The digit sum of a given integer is the sum of all its digits (digit sum of '84001' is calculated as 8+4+0+0+1 = 13). Odd number is an integer which is not a multiple of two. If it is "divided"

C Program Filter text with a stop word list - Read stoplist into binary tree, expects one entry per line. Split string into tokens, return token array. Make sure, copy string to a safe place. Always keep last entry null terminated.

C++ Program to Find LCM of two Integers - Examples on different ways to calculate LCM ("Lowest Common Multiple") of two integers using loops and decision making statements. "LCM of two integers" a and b is the smallest

Program to Check Whether Graph is DAG - This is a C++ Program code to check whether graph is DAG. In mathematics and computer science, a directed acyclic graph, is a directed graph with no directed cycles. It is formed by

Code to find Sum of Digits using recursion - Write a Recursive Function in C Language to calculate sum of digits of a number. Declare Recursive Function to find sum of digits of a number. First give a meaningful name to the

C++ Codings Sample Heap Sort Algorithm - The 'Heapsort' is a comparison-based sorting algorithm. 'Heapsort' can be thought of as an improved 'Selection Sort': like that algorithm, it divides its input into a sorted & an unsorted

Binary Search Tree non-recursive traversal - In this, includes the inserting a node, deleting a node, recursive tree traversal, non-recursive Tree Traversal, finding the minimum and the maximum, leftchild, rightchild, copy a tree to