$time php bubble.php real 0m0.133s user 0m0.084s sys 0m0.028s $
unsq.c Bot L130
while (same_count -- )
*wordp++ = (*prevp++);
size= UNSEQBUFSIZE - ( wordp -word );
...........
file.c 43% L172
case 10:
flags |= MAGIC_APPLE ;
break;
|= Bitwise OR and assign
fonttosfnt.c 51% L54
i =1;
while (i < argc) {
if (argv[i][0] != '-')
break ;
.....
fonttosfnt – Wrap a bitmap font in a sfnt (TrueType) wrapper
UNIX Command
$pwd /usr/share/fonts/X11/75dpi $fonttosfnt -o helvO12.ttf helvO12-ISO8859-1.pcf Couldn't select character map: 6. $ls helvO12 helvO12-ISO8859-1.pcf helvO12.pcf.gz $gunzip helvO12.pcf.gz $fonttosfnt -o helvO12.ttf helvO12.pcf $ls helvO12.ttf helvO12.ttf $file helvO12.ttf helvO12.ttf: TrueType font data $
UNIX Explanation
Wrap a bitmap font or a set of bitmap fonts in a sfnt (TrueType or OpenType) wrapper.
pcf . file type
Portable Compiled Font data
Bitmap . computer graphics
Bitmap
Explanation
In computer graphics, a bitmap or pixmap is a type of memory organization or image file format used to store digital images. The term bitmap comes from the computer programming terminology, meaning just a map of bits, a spatially mapped array of bits. Now, along with pixmap, it commonly refers to the similar concept of a spatially mapped array of pixels. Raster images in general may be referred to as bitmaps or pixmaps, whether synthetic or photographic, in files or memory. In certain contexts, the term bitmap implies one bit per pixel, while pixmap is used for images with multiple bits per pixel.[1][2]
Many graphical user interfaces use bitmaps in their built-in graphics subsystems;[3] for example, the Microsoft Windows and OS/2 platforms' GDI subsystem, where the specific format used is the Windows and OS/2 bitmap file format, usually named with the file extension of .BMP (or .DIB for device-independent bitmap). Besides BMP, other file formats that store literal bitmaps include InterLeaved Bitmap (ILBM), Portable Bitmap (PBM), X Bitmap (XBM), and Wireless Application Protocol Bitmap (WBMP). Similarly, most other image file formats, such as JPEG, TIFF, PNG, and GIF, also store bitmap images (as opposed to vector graphics), but they are not usually referred to as bitmaps, since they use compressed formats internally.
source: http://en.wikipedia.org/wiki/Bitmap
rmic – The Java RMI Compiler
Synopsis
rmic [ options ] package-qualified-class-name(s)
Explanation
The rmic compiler generates stub and skeleton class files (JRMP protocol) and stub and tie class files (IIOP protocol) for remote objects. These classes files are generated from compiled Java pro gramming language classes that are remote object implementation classes. A remote implementation class is a class that implements the interface java.rmi.Remote. The class names in the rmic command must be for classes that have been compiled successfully with the javac command and must be fully package qualified.
A skeleton for a remote object is a JRMP protocol server-side entity that has a method that dispatches calls to the actual remote object implementation. A tie for a remote object is a server-side entity similar to a skeleton, but which communicates with the client using the IIOP protocol. A stub is a client-side proxy for a remote object which is responsible for communicating method invo cations on remote objects to the server where the actual remote object implementation resides. A client's reference to a remote object, therefore, is actually a reference to a local stub.
shellsort using php
<?
// function shellsort($elements,$length)
// {
$elements = array(2,3,4,5,1,8,11,0);
$length = count($elements);
$k=0;
$gap[0]=(int) ($length / 2);
while($gap[$k]>1)
{
$k++;
$gap[$k]=(int)($gap[$k-1]/2);
}//end while
for($i=0;$i<=$k;$i++)
{
$step=$gap[$i];
for($j=$step;$j=0 && $temp<$elements[$p])
{
$elements[$p+$step]=$elements[$p];
$p=$p-$step;
}//end while
$elements[$p+$step]=$temp;
}//endfor j
}//endfor i
// return $elements;
print_r($elements);
// }// end function
?>
http://www.go4expert.com/forums/showthread.php?t=1255
selection sort using php
<?php
$arr = array(2,3,4,5,1,8,11,0);
// function selection_sort(&$arr) {
$n = count($arr);
for($i = 0; $i < count($arr); $i++) {
$min = $i;
for($j = $i + 1; $j < $n; $j++)
if($arr[$j] < $arr[$min])
$min = $j;
$tmp = $arr[$min];
$arr[$min] = $arr[$i];
$arr[$i] = $tmp;
}
// }
print_r($arr);
?>