Happy Codings - Programming Code Examples

HTML & CSS Web Design

Html Css > Code Examples

Aligning labels with List

Aligning labels with List

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
  <meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
  <title>Aligning labels with List</title>
  <style type="text/css">
  ul { list-style: none; margin: 0; padding: 0; }
  li { margin: .2em 0; }
  
  #info label { 
    float: left; 
    width: 240px; 
    margin-right: 20px; 
    text-align: right; 
  }
  </style>
</head>

<body>
  
<form id="info" method="post" action="/cgi-bin/action.cgi">
  <ul>
    <li><label>Your name</label> <input type="text" /></li>
    <li><label>Your Job</label> <input type="text" /></li>
    <li><label>Your favorite movie</label> <input type="text" /></li>
  </ul>
</form>

</body>
</html>

C Program to find Transpose of a Matrix - C program to read elements in a matrix and find transpose of the given matrix. How to find transpose of a given matrix in C. Input elements in matrix A from user. Declare...

C Programming Codes Reverse an Integer - C Reversing an integer, takes an integer input from the user. Then the while loop is used until n != 0 is false. In each iteration of while loop, the remainder when n is divided by 10

Header File for Stack in the C++ Language - Remove most recently inserted item. Return most recently inserted item. Return, remove most "recently inserted" item. Return true if empty; else false. Return true if 'full' and else

Program to Reverse every Word of Strings - Program 'takes a string', reverses every word of the string. Take a string as input and store each word of the input string in the separate rows of the '2-D array'. Reverse each word of

C Program sort directory entrys by filesize - Code compare function for qsort. Add ONE element to the array. Allocate memory for ONE 'struct node'. Copy the data into the new element ( structure ). Qsort array of...

C++ Coding Sorts a Data using Heap Sort - Heap sort is comparison based algorithm. It's selection sort sample. The time complexity is O(n*log(n)). Build a max heap using the given data element. And then Delete the root node

Perform to a 2D FFT Inplace a Complex 2D - A fast Fourier transform (FFT) is an algorithm to computing the discrete 'Fourier transform' and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT

Convert Decimal number to Octal Number - Accept the given decimal number. If number is less than 8 the octal number is the same. If the number > 7 then Divide the number with 8. Write down the remainder. Do steps 3 and