03-22-2006
Quote:
Originally Posted by nycol
What are you on about
maybe I wasn't clear.....
could explain what
you've tried and what
exactly you're having problem with?
10 More Discussions You Might Find Interesting
1. Programming
Hi,
Any one please let me know, how to write in to MQ Series through C. I tried, but it was vein, am expecting material(URL) or code.
Thanks,
Naga:cool: (5 Replies)
Discussion started by: Nagapandi
5 Replies
2. Shell Programming and Scripting
hi,
I'm a beginner to UNIX and got some problem in this fibonacci.Please help me out.Here is the code:
fibo()
{
if
then
fibo=` expr {fibo ($1 - 2)} + {fibo ($1 - 1)}` | bc
echo $fibo
fi
}
echo "enter a number:"
read x
#echo "The fibonnacci series for value $x is:"
fibo $x
... (4 Replies)
Discussion started by: janani_kalyan
4 Replies
3. Shell Programming and Scripting
I am facing problem with Shell script to generate Fibonacci series using recursion i.e. recursive function.
Here is my script:
#!/bin/sh
fibo()
{
no=$1
if ; then
return 0
elif ; then
return 1
else
a1=`expr $no - 1`
fibo $a1
... (10 Replies)
Discussion started by: Tapas Bose
10 Replies
4. Shell Programming and Scripting
pls give me the solution for this i need it for my exam pls pls pls
Shell script to find the sum of first n Fibonacci numbers (1 Reply)
Discussion started by: Kshitija
1 Replies
5. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
Shell script to find sum of first n numbers of Fibonacci series
2. Relevant commands, code, scripts,... (0 Replies)
Discussion started by: Kshitija
0 Replies
6. UNIX for Dummies Questions & Answers
So, Just for practice, I wrote a simple fibonacci sequence script in bash.
(03:08:02\$ cat fib
#!/usr/bin/bash
ret ()
{
echo -ne "\n"
sleep .5
}
a=1
b=2
echo -n $a #1 A
ret
echo -n $b #2 B
ret (8 Replies)
Discussion started by: DeCoTwc
8 Replies
7. Programming
When i run this with gcc filename.s -o filename. It is giving fatal error: Unknown opcode at define registers.
Anyhelp will be appreciated
.section ".data"
prompt: .asciz "\nThis program prints the Fibonacci sequence"
prompt2: .asciz "\nEnter a limit on the largest number to be displayed:"... (2 Replies)
Discussion started by: Learnerabc
2 Replies
8. Solaris
Hi All,
Do anyone know if I upgrade cpu module and memory module for one of the domain inside Sun M5000. After the upgrade, will the hostid for the domain change or it will remain as long we don't change the system board?
Currently will try to upgrade one of the Sun M5000 with 4 domains... (2 Replies)
Discussion started by: mailbox80
2 Replies
9. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
I am trying to convert a C language program over to Sparc Assembley and I am getting Undefined first referenced... (4 Replies)
Discussion started by: kenjiro310
4 Replies
10. Shell Programming and Scripting
Hello, I am a beginner to shell programming. Coded the following for Fibonacci series.
#!/bin/bash
fib() {
i=0
j=1
arr=0
arr=1
echo "enter the limit:"
read n
while
do
fo= expr $j - 1
f1=$j
f2= expr $j + 1
arr= expr ${arr} + ${arr}
echo ${arr} (3 Replies)
Discussion started by: Rookie222
3 Replies
LEARN ABOUT DEBIAN
heap::elem::refrev
Heap::Elem::RefRev(3pm) User Contributed Perl Documentation Heap::Elem::RefRev(3pm)
NAME
Heap::Elem::RefRev - Reversed Object Reverence Heap Elements
SYNOPSIS
use Heap::Elem::RefRev( RefRElem );
use Heap::Fibonacci;
my $heap = Heap::Fibonacci->new;
my $elem;
foreach $i ( 1..100 ) {
$obj = myObject->new( $i );
$elem = RefRElem( $obj );
$heap->add( $elem );
}
while( defined( $elem = $heap->extract_top ) ) {
# assume that myObject object have a method I<printable>
print "Largest is ", $elem->val->printable, "
";
}
DESCRIPTION
Heap::Elem::RefRev is used to wrap object reference values into an element that can be managed on a heap. Each referenced object must have
a method cmp which can compare itself with any of the other objects that have references on the same heap. These comparisons must be con-
sistant with normal arithmetic. The top of the heap will have the largest (according to cmp) element still remaining. (See
Heap::Elem::Ref if you want the heap to always return the smallest element.)
The details of the Elem interface are described in Heap::Elem.
The details of using a Heap interface are described in Heap.
AUTHOR
John Macdonald, john@perlwolf.com
COPYRIGHT
Copyright 1998-2007, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
SEE ALSO
Heap(3), Heap::Elem(3), Heap::Elem::Ref(3).
perl v5.8.8 2007-10-23 Heap::Elem::RefRev(3pm)