Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^2: Easiest city to find Perl work:

by samizdat (Vicar)
on Apr 19, 2006 at 12:51 UTC ( #544349=note: print w/replies, xml ) Need Help??

in reply to Re: Easiest city to find Perl work:
in thread Easiest city to find Perl work:

Hear, hear!

Not to mention the possibility of creating a project and hiring telecommuters from wherever they are... no taxes, no staff coffeemaker, no watercooler politics discussions on your dime...

It's not just France... we've had a few "dust ups" (love that phrase) here in the US about all these "furriners" who are showing up our homegrown programmers, or, at least, underbidding them. Tempest in a teapot, of course; Ukrainian and Russian programmer paychecks are now rising rapidly, and people here have rediscovered the benefits of live team brainstorming sessions.

As we have. We started our business with two Ukrainian brothers and a few others, built our systems over the course of several years, and have now imported them (the brothers) into the US, paying them US-sized paychecks. It allowed us to survive our own fumbling attempts to define our product and our market, and keep the business going until it was profitable. Now that it is, we're reaching for the next level, with our two very good programmer friends having earned a piece of the company. I don't know that we could have done so had we tried to depend on only my programming skills or hiring American talent. And yes, we got lucky, hiring two of the most talented and loyal guys over there.

Don Wilde
"There's more than one level to any answer."

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://544349]
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved
[oiskuu]: I must watch Police Academy again sometime.

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2018-03-19 11:24 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.