Happy Codings - Programming Code Examples

JavaScript Programming

JavaScript > Code Examples

Add Favorite



Add Favorite
    
<html>
<head>
<script language="JavaScript">
    function function1() {
        window.external.AddFavorite('http://javascript.happycodings.com/');
    }
</script></head>
<body>
<button onclick="function1();">
Happy Codings :-) C++, C#, HTML, Java, JavaScript Code Examples
</button>
</body>
</html>

C Matrix of Order M x N and Interchange
C language program code to accept a matrix of order M x N and store its elements and interchange the main diagonal elements of the matrix with that of secondary diagonal

Find Angles of triangle if two angles given
C Program to input two angles from user and find third angle of the triangle. How to find all angles of a triangle if two angles are given by user using C programming. Sum of angles of

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

Convert Octal Number Decimal Vice Versa
In the program, the octal number is stored in the variable octalNumber, passed to function octalToDecimal(). This function converts the octal number passed by user to its equivalent

Takes octal number as input and converts
C Program take a octal number as input and store it in the array octalnumber and using switch statement access each digit of a octal number and print its equivalent binary value

Reading From and Writing to a File in C++
While writing C++, coders write information to a file from the program using the "stream" insertion operator (<<) and reads information using the "Stream Extraction" Operator (>>).

Read an Array and Search for an Element
C code accept an array of N elements and a key to search. If the search is successful, it displays "Successful Search". Otherwise, a message "UNSUCCESSFUL SEARCH" is...

Finding the Edge Connectivity of a Graph
C++ Program to find edge connectivity of a graph. An edge in an undirected connected graph is a bridge if removing it disconnects the graph. For a "disconnected undirected"