Skip to content

Instantly share code, notes, and snippets.

View ahmedeshaan's full-sized avatar

Ahmed Eshaan ahmedeshaan

View GitHub Profile
<?xml version="1.0" encoding="utf-8"?>
<!--
@package Gallery
@copyright Copyright (c)2013 Nicholas K. Dionysopoulos / AkeebaBackup.com
@license GNU General Public License version 2 or later
Categories view form file
-->
<?xml version="1.0" encoding="utf-8"?>
<!--
@package gallery
@copyright Copyright (c)2013 Nicholas K. Dionysopoulos / AkeebaBackup.com
@license GNU General Public License version 2 or later
Category Signle view form file
-->
<form validate="true" serverside_validate="true">
<fieldset name="basic_information"
#include <stdio.h>
#include <stdlib.h>
int main()
{
int bin = 0;
printf("Please Enter your positive binary number:");
# For loop
for num in 1..10
for new_num in 1..num
print new_num
end
puts "\n"
end
//Decimal To Binary Recursive function
#include <stdio.h>
#include <stdlib.h>
int arg;
int newVar;
int modulus[10];
int i=0;
void myFunction(arg){
//Decimal To Octal Recursive function
#include <stdio.h>
#include <stdlib.h>
int arg;
int newVar;
int modulus[10];
int i=0;
void recusiveMain(arg){
@var = 'Hi'
puts "#@var there!" #=> "Hi there!"
$var = 'Hi'
puts "#$var there!" #=> "Hi there!"
//Recursive function
#include <stdio.h>
#include <stdlib.h>
int arg;
int newVar;
int modulus[10];
int i=0;
void recusiveMain(arg){
class ObscuringReferences
attr_reader :data
def initialize(data)
@data = data
end
def diameters
data.collect { |cell|
cell[0] + (cell[1] * 2) }
end
#include <stdio.h>
#include <stdlib.h>
int flag = 0,
output = 0,
loopInt = 0,
modulus = 0,
mutiplication = 0,
sum = 0;
//int square = 1;