[algogeeks] Certified Microsoft .NET web Developer///////Madison, WI //////3 Years

2014-01-29 Thread Ben Lee
* SQL Client tools * .Net (MS) * ASP.NET * Crystal Reports * ASP.Net MVC * Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big

[algogeeks] Oracle Apps Techno Functional Consultant//////Columbus, OH////12+Months

2014-01-29 Thread Ben Lee
Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big Beaver Rd. Suite 200 Troy, MI 48084 Phone : 248-918-2510 EXT 1006 Email : ben@viprainfosystems.com -- You

[algogeeks] Sr. Network Engineer Columbus, OH 6+ months

2014-01-29 Thread Ben Lee
-on experience with Wintel, UNIX and/or Linux operating systems ยท Experience with Firewalls, IPS / IDS and Load Balancers Thanks and Regards, Ben Lee Sr. Technical

[algogeeks] .NET web Developer ///////// Madison, WI ///////////3 Years

2014-01-29 Thread Ben Lee
* SQL Client tools * .Net (MS) * ASP.NET * Crystal Reports * ASP.Net MVC * Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big

[algogeeks] Availability of Sharepoint Admin or Architect

2014-01-29 Thread Ben Lee
, UNIX, MVS, ES 9000, MPE/iX, MAC. Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big Beaver Rd. Suite 200 Troy, MI 48084

[algogeeks] Availability of Sharepoint Admin or Architect

2014-01-29 Thread Ben Lee
, MVS, ES 9000, MPE/iX, MAC. Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big Beaver Rd. Suite 200 Troy, MI 48084 Phone

[algogeeks] Sr. Java Developer//////Columbus, OH /////// 6+ months

2014-01-29 Thread Ben Lee
Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big Beaver Rd. Suite 200 Troy, MI 48084 Phone : 248-918-2510 EXT 1006 Email : ben@viprainfosystems.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe

[algogeeks] SAP FICO Sr Functional Analyst ////Columbus, OH /////////1 Year

2014-01-29 Thread Ben Lee
Thanks and Regards, Ben Lee Sr. Technical Recruiter VIPRA INFO SYSTEMS 100 Liberty Center West Big Beaver Rd. Suite 200 Troy, MI 48084 Phone : 248-918-2510 EXT 1006 Email : ben@viprainfosystems.com

[algogeeks] quick sort

2011-01-04 Thread lee
how can we make quick sort to run in O(logn) time in worst case?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to

Re: [algogeeks] palindrome problem

2010-11-16 Thread cheng lee
how to do that in O(|s|^2)? 2010/11/16 anoop chaurasiya anoopchaurasi...@gmail.com will O(|s|^2) dp workor u need something more efficient than that On Tue, Nov 16, 2010 at 1:51 PM, lichenga2404 lichenga2...@gmail.comwrote: A palindrome is a string which is identical to itself in

Re: [algogeeks] Re: student introduction problems

2010-11-07 Thread cheng lee
Could you please explain a little more about how it connect the problem with the content in that webpage? Thank you 2010/11/6 Raj rajmangaltiw...@gmail.com http://www.cs.utexas.edu/~moore/best-ideas/mjrty/index.htmlhttp://www.cs.utexas.edu/%7Emoore/best-ideas/mjrty/index.html On Nov 7,

Re: [algogeeks] student introduction problems

2010-11-07 Thread cheng lee
Where can we see that this algorithm use the divide and conquer techniques? 2010/11/7 Pratik Bhadkoliya pkbhadkol...@gmail.com A Linear-time Majority Vote Algorithm Problem: How to decide, in one pass which element of a sequence is in the majority, provided there is such an element. As

Re: [algogeeks] Re: divide and conquer

2010-11-07 Thread cheng lee
than 2^k + 2^(k-1) + 2^(k-2) + ... + 2^1 + 2^0 - 2(2^k) - 1 2n, so the work is O(n). Dave On Nov 6, 6:18 pm, cheng lee lichenga2...@gmail.com wrote: Hi , Dave Why to do like this :Make a list of the indices of the numbers with 0 bits and a list of the indices of the numbers with 1 bits

Re: [algogeeks] Re: divide and conquer

2010-11-06 Thread cheng lee
Hi , Dave Why to do like this :Make a list of the indices of the numbers with 0 bits and a list of the indices of the numbers with 1 bits. One of the lists will be of even length, and one will be of odd length. ? 2010/11/3 Dave dave_and_da...@juno.com @Lichenga2404: Examine the leftmost bit of

[algogeeks] Refresher

2009-03-22 Thread Lee
Take a couple of minutes off from your hectic work, and take this survey - http://www.esurveyspro.com/Survey.aspx?id=6d3b9406-f253-4c52-8d19-b2dccbd0d95a --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm