Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: asterisk pattern

by choroba (Abbot)
on Oct 27, 2011 at 11:15 UTC ( #934114=note: print w/ replies, xml ) Need Help??


in reply to asterisk pattern

No explicit loop, just recursion and repetition:

$p=1;sub p{my$x=shift;$x||exit;say" "x(3-$x),"*"x$x;$p=-1if$x>2;p($x+$ +p)}p 1
Update: Not so funny in C:
#include<stdio.h> int p,n;void q(int x){int j;if(!x)return;for(j=1;j<=n-x;j++)printf(" " +);for(j=1;j<=x;j++)printf("*");printf("\n");if(x>=n)p=-1;q(x+p);}void + main(){printf("Enter the number of columns: ");scanf("%d",&n);p=1;q( +1);}
(I've never really used C, anyway.)


Comment on Re: asterisk pattern
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://934114]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (6)
As of 2014-12-26 02:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (164 votes), past polls