Re: [algogeeks] Scheduling

[Aakash Johari]

yes, it's correct. simply sort according to their costs (in decreasing
order)

On Mon, Jun 6, 2011 at 11:52 PM, sunny agrawal wrote:

> Sort in decreasing order of Ci ?
>
>
> On Tue, Jun 7, 2011 at 8:22 AM, aanchal goyal wrote:
>
>> Given n jobs, each ith job has a cost Ci associated with it. The waiting
>> time for a job i is defined as Ci*Delay, where Delay is the number of days
>> it takes from the first day to complete a job. Assume each job can be
>> completed in 1 day. So, a job started at day 1 will have delay=1, the one
>> started at day 2 will have delay=2, etc. Order the jobs in such a way that
>> waiting time is minimum.
>>
>>
>> --
>> Regards,*
>> Aanchal Goyal*.
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Sunny Aggrawal
> B-Tech IV year,CSI
> Indian Institute Of Technology,Roorkee
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
-Aakash Johari
(IIIT Allahabad)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Scheduling

[sunny agrawal]

Sort in decreasing order of Ci ?

On Tue, Jun 7, 2011 at 8:22 AM, aanchal goyal wrote:

> Given n jobs, each ith job has a cost Ci associated with it. The waiting
> time for a job i is defined as Ci*Delay, where Delay is the number of days
> it takes from the first day to complete a job. Assume each job can be
> completed in 1 day. So, a job started at day 1 will have delay=1, the one
> started at day 2 will have delay=2, etc. Order the jobs in such a way that
> waiting time is minimum.
>
>
> --
> Regards,*
> Aanchal Goyal*.
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Sunny Aggrawal
B-Tech IV year,CSI
Indian Institute Of Technology,Roorkee

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Request for books

[rupali chauhan]

sorry dnt hav these books

On Sun, Jun 5, 2011 at 7:10 PM, Ankit Sablok
wrote:

> If some one has the following books
>
> Algorithms and Data structures in C - Mark Allen Weiss
> Network Flow Algorithms - by Ahuja
>
> please mail it to ankitsablok19091...@gmail.com
>
> thanxx in advance
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Request for books

[shady]

hi,
does anybody have it in their college server ? I need it for research
purposes.

Thanks.

Shady

On Sun, Jun 5, 2011 at 11:17 PM, shady  wrote:

> hey,
> Can anyone provide me with this e-book
> 1.  Automatic summarization By Inderjeet Mani
> 2. *Advances in Automatic Summarization By Inderjeet Mani*
> *
> *
> It tried searching in rapidshare and for torrents but couldn't find any.
> Even a draft would be helpful.
> I will be grateful to you.
>
> Thanks.
>
> Shady
>
>
> On Sun, Jun 5, 2011 at 10:57 PM, Gaurav Aggarwal <0007gau...@gmail.com>wrote:
>
>> and if you rather buy these books instead of asking for pirated copies
>> then isn't that would be best??
>>
>>
>> On Sun, Jun 5, 2011 at 8:09 PM, Ankit Sablok <
>> ankitsablok19091...@gmail.com> wrote:
>>
>>> also if one can mail me all the versions of sedgewick I will b
>>> grateful
>>>
>>> On Jun 5, 6:40 pm, Ankit Sablok  wrote:
>>> > If some one has the following books
>>> >
>>> > Algorithms and Data structures in C - Mark Allen Weiss
>>> > Network Flow Algorithms - by Ahuja
>>> >
>>> > please mail it to ankitsablok19091...@gmail.com
>>> >
>>> > thanxx in advance
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>>
>>
>> --
>> Gaurav Aggarwal
>> SCJP
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[shashankreddy509]

http://mathworld.wolfram.com/TwinPrimes.html


have look at this link...

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/NFpFVE1lTzVfVVVK.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Peoplesoft Developer // Chicago, IL // 4 month contract+

[ross]

people like you pollute algogeeks!!
Go get a life and get lost!
We would love to work in the US but we are not here to get spammed by
you.


On Jun 7, 12:08 am, sohail panzer  wrote:
> Dear Consultant,
> Hope you are doing good,
> Please let me know if you are comfortable with the requirement.
>
> *Please reply at soh...@panzersolutions.com*
>
> *Position :Peoplesoft Developer
> Location:Chicago, IL
> Duration:4 month contract+*
>
> *Responsibility Summary: *
>
> Responsible to customize and test application engine components as well as
> online functionality enhancements of varying complexity in a PeopleSoft
> environment.
> Perform development and testing throughout the standard development life
> cycle assisting with the functional analysis as needed.
> Work closely with the Business Analysts to ensure that the business
> requirement needs are met.
> Document all changes, following a standard methodology.
>
> *Skill set needed:*
>
> Working knowledge of the PeopleSoft EPM application - EPM 9.0 (Preferably)
> architecture and processes.
> Experience with ABM (Activity Based Management) or FTP (Funds Transfer
> Pricing) is highly preferred.
> Extensive working Experience with PeopleTools (8.49 Preferred):
> Application Designer
> Page/Component/Menu Development
> Component Interface
> Application Engine
> PeopleCode
> Integration Tools
> P/S Query
> Online and Batch troubleshooting
> Application Server and Web Server (Web Logic)
> Experience with working in DB2 & AIX environments
> Expertise in Relational Database/SQL Knowledge (DB2 preferred)
> Experience with writing and modifying UNIX scripts
> Experience in full life cycle implementation / upgrade of PeopleSoft systems
>
> Knowledge, Skills and Abilities:
> Thorough knowledge of applications/development methodologies
> Considerable knowledge of performance tuning
> Skill in project management experience
> Skill in operating independently
> Skill in exhibiting solid analysis, decision-making, and problem solving
> Ability to assess requirements, alternatives, and risks/benefits for low- to
> high-impact projects
> Ability to communicate effectively verbally and in writing.
> === 
> 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: SharePoint Developer Needed in PA -- F2F Required

[ross]

@Leon Parker:
The same panzer solutions and the same spam.
Dude, Please do not spam this group. Go get away
we are here to discuss DS and Algos and not your requirement of
professionals.!!


On Jun 7, 12:24 am, Leon Parker  wrote:
> Hello Associate,
>
> Please let me know if you have any consultants for the below position?
>
> Job Title: SharePoint Developer
> Location: Horsham, PA
> Duration: 6 Months
>
> *Rate: $50/hr on C2C*
>
> Solid Sharepoint Developer with 2010 experience.
> This consultant must have an extensive background with SharePoint 2007.
> They will be leading the efforts for the development of enhancements to the
> SharePoint search function.
> Must have excellent communication/interaction/mentoring skills since they
> will be training/mentoring junior developers and communicating with offshore
> resources
> Local candidates have the best shot
>
> Thanks
> Leon Parker - l...@panzersolutions.com
> 203-983-9475

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[nicks]

nice One !!

On Mon, Jun 6, 2011 at 1:02 PM, coder dumca  wrote:

> thanks arpit :)
>
>
> On Tue, Jun 7, 2011 at 12:43 AM, Arpit Sood  wrote:
>
>> (3 5) (5 7) (11 13) (17 19)
>> so in short if you do a +1, -1 to these pairs you will get one number
>> 4, 6, 12, 18.. and it goes like this
>>
>>
>> On Tue, Jun 7, 2011 at 12:04 AM, coder dumca wrote:
>>
>>> I still didn't got arpit can u explain pls.
>>>
>>>
>>> On Mon, Jun 6, 2011 at 7:15 AM, shashankreddy509 <
>>> shashankreddy...@gmail.com> wrote:
>>>
 thanks Arpit
 --
 You received this message because you are subscribed to the Google
 Groups "Algorithm Geeks" group.
 To view this discussion on the web visit
 https://groups.google.com/d/msg/algogeeks/-/VXJkN2RnOTBnOU1K.

 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.

>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> Regards,
>> Arpit Sood
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Scheduling

[aanchal goyal]

Given n jobs, each ith job has a cost Ci associated with it. The waiting
time for a job i is defined as Ci*Delay, where Delay is the number of days
it takes from the first day to complete a job. Assume each job can be
completed in 1 day. So, a job started at day 1 will have delay=1, the one
started at day 2 will have delay=2, etc. Order the jobs in such a way that
waiting time is minimum.


-- 
Regards,*
Aanchal Goyal*.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[Gaurav Aggarwal]

Thanks subramania.. It is very nice explanation.. [?]

On Mon, Jun 6, 2011 at 8:33 PM, subramania jeeva
wrote:

> @Gaurav Aggarwal
> Obviously O(n^2) worst case if we use ordinary quick sort with slight
> modification(Best case O(n))...
> But quick sort can also be done by taking median as element for partition
> instead of taking first or last element which will take O(nlgn) worst case
> complexity...
> But to do the given problem median of median algorithm is best.. It will
> take O(n) in worst case...
>
> 1. Divide the n elements of input into n/5 groups
> 2. Find median of each group by insertion sort(performs well for small
> inputs) and pick the median for each each group.
> 3. Repeat steps (1) and (2) repeatedly to find a single median
> 4.partition the array using that median. such that  k elements are in lower
> partition and n-k elements are in higher side of partition.(use the
> partition insuch a way that smallest elements are on higher side of
> partition and largest elements are on lower side of partition)
>
> 5. If index i==k(ith largest element) then return a[i].. else recurse steps
> 1 to 5 such that (if i>k then use k to r) (else use p to k)(p is the
> starting index and r is ending index)..
>
> I hope It explains the code given by piyush sinha..
>
>
>
>
>
>
>
>
>
> Cheers
>   ~ Jeeva ~
>
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Gaurav Aggarwal
SCJP

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

<<328.png>>

Re: [algogeeks] SPOJ ETF

[saurabh singh]

Can sum1 plz give me the link to the problem?
2011/6/5 keyan karthi 

> also tc page tat arun said says as follows...
>
>
>1. If *p* is prime, then φ (*p*) = *p* - 1 and φ (*pa*) = *p** a* * (1
>- 1/*p*) for any *a*.
>2. If *m* and *n* are coprime, then φ (*m* * *n*) = φ (*m*) * φ (*n*).
>3. If *n* = , then Euler function can be found using formula:
>
> φ (*n*) = *n* * (1 - 1/*p* 1) * (1 - 1/*p* 2) * ... * (1 - 1/*p k*)
> make sure u check this...
> i did the loop stuff in that page.. ve not tried ma hands on sieve...
>
> On Sun, Jun 5, 2011 at 9:20 PM, kartik sachan wrote:
>
>> @keyan then also it is given time limit exceed 
>> i don't know what to do..plzz help me plz
>>
>> my modified code is :
>>
>> # include
>> int main()
>> {
>> long long int phi[101];
>> long long int i,j,t1,k;
>> scanf("%lld",&t1);
>> while(t1--)
>> {
>> scanf("%lld",&k);
>> phi[1]=1;
>>   for ( i=2; i<=k; ++i) phi[i]=i;
>>   for ( i=2; i<=k; ++i)
>>
>> if (phi[i]==i) // prime
>>for ( j=i; j<=k; j+=i)
>>
>> phi[j]=phi[j]/i*(i-1);
>>
>>
>>
>>
>> printf("%lld\n",phi[k]);
>>   }
>> return 0;
>>
>> }
>>
>>
>>
>>
>>
>>
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Microsoft ques : reverse of dutch national flag problem

[hary rathor]

 char str[]="abcdABCD1234";
int i,len=strlen(str)-1;
int j=0,l=0;


printf("%s",str);
 printf("\n");
for(i=0;i<=len;i++)
{
  printf("%c",str[j]);
  j=j+4;
  if(j>len)j=++l;

}

it prtint your desired result ,

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] SharePoint Developer Needed in PA -- F2F Required

[Leon Parker]

Hello Associate,

Please let me know if you have any consultants for the below position?

Job Title: SharePoint Developer
Location: Horsham, PA
Duration: 6 Months

*Rate: $50/hr on C2C*

Solid Sharepoint Developer with 2010 experience.
This consultant must have an extensive background with SharePoint 2007.
They will be leading the efforts for the development of enhancements to the
SharePoint search function.
Must have excellent communication/interaction/mentoring skills since they
will be training/mentoring junior developers and communicating with offshore
resources
Local candidates have the best shot

Thanks
Leon Parker - l...@panzersolutions.com
203-983-9475

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] .Net/SharePoint Developer Needed in TX -- F2F required -- Only local consultants

[Leon Parker]

Hello Associate,

Please let me know if you have any consultants for the below position?

Job Title: .Net/SharePoint Developer
Location: Irving, TX
Duration: 6-9 Months

Rate: $50/hr on C2C

4-5 years .Net, 2-3 years SharePoint 2007 or 2010; 2010 strongly preferred
C#; MOSS 7,10; SSAS; SSIS; SSRS; ASP.Net; Framework 3.5; MS-SQL; Web
Applications, Web Services, HTML, XML, SOAP, WinServer

Responsibilities:
Develop and implement applications and sites using .NET and SharePoint 2010
Use Agile development process to document requirements, design solutions
Must be able to work with changing requirements
Flexible and able to work with minimal requirement

Qualifications:
Must have 5 years of overall distributed object-oriented software
development experience
Must have 5 years of experience of development in .NET technologies with
focus on WCF, WF, etc. within Sharepoint 2010 environment
Must have 2-3 years of SharePoint development experience
Must have 2-3 years of development and deployment of SharePoint environment:
specifically Site Templates, Site Definitions, Taxonomy, Metadata, Content
Management, Collaboration, Windows Workflow Foundation, Custom Web Parts,
Reports, BCS, FAST Search, Master Pages, Content Types, Features,
PerformancePoint, Security in Claims Base Identity, Single Sign On, Web
Parts, Workflows, Master Pages and Content Pages
Must have experience implementing custom applications within Sharepoint 2010
for external internet facing Sharepoint sites for large scale systems
Familiar with SharePoint administration, configuration and customization
experience
Hands-on implementation knowledge SQL Server with knowledge of SSIS, SSAS,
SSRS. Strong understanding of database design
Must have strong verbal and written communication skills
Detailed knowledge of configuration, development and deployment of the
SharePoint Platform
Team Foundation Server (TFS) development experience

Thanks
Leon Parker - l...@panzersolutions.com
203-983-9475

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] SQL-BI Developer // Franklin, TN // 6+ months contract

[sohail panzer]

 Dear Professional,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com*

Title  :   SQL-BI Developer
Location   :   Franklin, TN
Duration  :   6+ months contract
Rate  :   $42/Hr on Corp-Corp



MUST:
5+ years of experience developing ETL packages with SSIS in a Microsoft SQL
Server 2005 or 2008 environment including scheduling and automation using
SQL Server Agent
5+ years of experience developing reports using SSRS in a Microsoft SQL
Server 2005 or 2008 environment
5+ years of experience in writing SQL stored procedures in a Microsoft SQL
Server 2005 or 2008 environment
5+ years of experience developing ETL and reporting solutions within a
dimensional database architecture with proficiency in Type-2 slowly changing
dimensions Studio
Healthcare experience a MUST

PLUS:
3+ years of experience developing cubes, reports, and dashboards using SSAS
and MDX SQL in a Microsoft SQL Server 2008 environment
Familiar with cubes and reports in IBM Cognos 8 Framework Manager and Report

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Peoplesoft Developer // Chicago, IL // 4 month contract+

[sohail panzer]

Dear Consultant,
Hope you are doing good,
Please let me know if you are comfortable with the requirement.

*Please reply at soh...@panzersolutions.com*


*Position :Peoplesoft Developer
Location:Chicago, IL
Duration:4 month contract+*

*Responsibility Summary: *

Responsible to customize and test application engine components as well as
online functionality enhancements of varying complexity in a PeopleSoft
environment.
Perform development and testing throughout the standard development life
cycle assisting with the functional analysis as needed.
Work closely with the Business Analysts to ensure that the business
requirement needs are met.
Document all changes, following a standard methodology.

*Skill set needed:*

Working knowledge of the PeopleSoft EPM application - EPM 9.0 (Preferably)
architecture and processes.
Experience with ABM (Activity Based Management) or FTP (Funds Transfer
Pricing) is highly preferred.
Extensive working Experience with PeopleTools (8.49 Preferred):
Application Designer
Page/Component/Menu Development
Component Interface
Application Engine
PeopleCode
Integration Tools
P/S Query
Online and Batch troubleshooting
Application Server and Web Server (Web Logic)
Experience with working in DB2 & AIX environments
Expertise in Relational Database/SQL Knowledge (DB2 preferred)
Experience with writing and modifying UNIX scripts
Experience in full life cycle implementation / upgrade of PeopleSoft systems

Knowledge, Skills and Abilities:
Thorough knowledge of applications/development methodologies
Considerable knowledge of performance tuning
Skill in project management experience
Skill in operating independently
Skill in exhibiting solid analysis, decision-making, and problem solving
Ability to assess requirements, alternatives, and risks/benefits for low- to
high-impact projects
Ability to communicate effectively verbally and in writing.
===

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[coder dumca]

thanks arpit :)


On Tue, Jun 7, 2011 at 12:43 AM, Arpit Sood  wrote:

> (3 5) (5 7) (11 13) (17 19)
> so in short if you do a +1, -1 to these pairs you will get one number
> 4, 6, 12, 18.. and it goes like this
>
>
> On Tue, Jun 7, 2011 at 12:04 AM, coder dumca wrote:
>
>> I still didn't got arpit can u explain pls.
>>
>>
>> On Mon, Jun 6, 2011 at 7:15 AM, shashankreddy509 <
>> shashankreddy...@gmail.com> wrote:
>>
>>> thanks Arpit
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To view this discussion on the web visit
>>> https://groups.google.com/d/msg/algogeeks/-/VXJkN2RnOTBnOU1K.
>>>
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Regards,
> Arpit Sood
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] AMAZON Q

[Piyush Sinha]

Design your hash_map that allow the following Add in O(1) , delete in
O(1) , iterate in O(n)?

-- 
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[Arpit Sood]

(3 5) (5 7) (11 13) (17 19)
so in short if you do a +1, -1 to these pairs you will get one number
4, 6, 12, 18.. and it goes like this

On Tue, Jun 7, 2011 at 12:04 AM, coder dumca  wrote:

> I still didn't got arpit can u explain pls.
>
>
> On Mon, Jun 6, 2011 at 7:15 AM, shashankreddy509 <
> shashankreddy...@gmail.com> wrote:
>
>> thanks Arpit
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To view this discussion on the web visit
>> https://groups.google.com/d/msg/algogeeks/-/VXJkN2RnOTBnOU1K.
>>
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Regards,
Arpit Sood

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] West End College London

[Geo News]

*West End College London
Study abroad Learn Beautician  in London.A wide range of courses.
http://bit.ly/Top50U

http://bit.ly/Top50U

==
*

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] repeted element

[the coder]

can we find  the first repeated element in array in O(N) complexity.
Array may contain more than 1 repeated elements.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[coder dumca]

I still didn't got arpit can u explain pls.

On Mon, Jun 6, 2011 at 7:15 AM, shashankreddy509  wrote:

> thanks Arpit
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/VXJkN2RnOTBnOU1K.
>
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[PRAMENDRA RATHi rathi]

tnx all of u...what a foolish mistake i hd done:P

On Mon, Jun 6, 2011 at 10:38 PM, saurabh singh  wrote:

> Agree with logic king...Moreover have you thouht of using maps?That will
> improove your code's efficiency(With respect to current code) and also make
> it shorter,
>
> On Mon, Jun 6, 2011 at 5:12 PM, Logic King wrote:
>
>> How can you assume that team name cannot be other than these.where in
>> the question is written that only these teams will constitute the last 16.
>>
>> i hope you got my point and your mistake as well !!
>>
>> On Mon, Jun 6, 2011 at 4:28 AM, PRAMENDRA RATHi rathi <
>> prathi...@gmail.com> wrote:
>>
>>>
>>> no, i am getting wrong answer again with this logic..
>>>
>>> it is my code::
>>>
>>> int main()
>>> {
>>> register int test,i,j,winner=0,g1,g2;
>>> string s1,s2;
>>> string
>>> team[16]={"ARG","BEL","BRZ","CAM","COL","CRC","CZE","ENG","GER","IRE","ITA","NET","ROM","SPA","URU","YUG"};
>>>
>>> cin >>test;
>>> while(test--)
>>> {
>>> int point[16]={0};
>>> for(j=0;j<16;j++)
>>> {
>>> cin>>s1>>s2>>g1>>g2;
>>> if(g1>g2)
>>> {
>>> for(i=0;i<16;i++)
>>> {
>>> if(s1==team[i])
>>> {point[i]++;break;}
>>> }
>>> }
>>> else
>>> {
>>> for(i=0;i<16;i++)
>>> {
>>> if(s2==team[i])
>>> {point[i]++;break;}
>>> }
>>> }
>>>
>>> }
>>> int big=0;
>>> for(i=0;i<16;i++)
>>>
>>> { cout<<"team "<>> if(point[i]==4){cout<>>
>>> }
>>>
>>> return 0;
>>>
>>> }
>>>
>>>
>>> On Mon, Jun 6, 2011 at 1:49 PM, nicks wrote:
>>>
 @parmendra..yeah u r right what's ur problem u r not able to implement
 it r whatonly winner will win 4 matches runner and 3rd posn will win 3
 match each...


 On Mon, Jun 6, 2011 at 12:47 AM, arun kumar wrote:

> any team which has nt lost a match will win
>
> On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
>  wrote:
> > i am thinking that the team with win point 4 will be the winner ..
> > is this wrong?
> >
> > https://www.spoj.pl/problems/SBETS/
> >
> >
> > because there are only 16 match 8+4+2+1(final) +1(for  runner up)
> > so any team can play at max 4 match.
> >
> > --
> > You received this message because you are subscribed to the Google
> Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> > http://groups.google.com/group/algogeeks?hl=en.
> >
>
> --
> You received this message because you are subscribed to the Google
> Groups "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
 --
  You received this message because you are subscribed to the Google
 Groups "Algorithm Geeks" group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.

>>>
>>> --
>>>  You received this message because you are subscribed to the Google
>>> Groups "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Saurabh Singh
> B.Tech (Computer Science)
> MNNIT ALLAHABAD
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] WCS (Websphere Commerce Suite) Developers/Architects - HP/Borders- Ann Arbor

[sohail panzer]

*Openings: 4 (2 WCS Developers, 1 Architect, 1 Front End Developer)*

*Location: Ann Arbor, MI*

*Duration: 6 months to perm or long term ext***


**


**

*
*

*WCS FRONT-END DEVELOPER*

**

*DESCRIPTION*
We are looking for solid Front-end Developers to join a team taking over a
live WCS implementation.  Front-end Developers will:
1) Maintain and create JSPs for eCommerce WCS system
2) Implement page layout (using CSS) as designed/directed by Business
3) Write/maintain JavaScript
4) Assure page functionality across supported browsers
5) Assist Development team with unit tests

*REQUIRED SKILLS*
Some experience with Java
Experience with JSP/web development
Good CSS skills
Good JavaScript experience

*DESIRED SKILLS*
WebSphere Commerce experience
Familiarity with Sterling Order Management System**

*
-
*



*Programmer Analyst (WCS DEVELOPER **)*

*Responsibilities:*
• Create detailed specifications from which systems are developed or
implemented
• Analyze business and user needs and recommend creative solutions
• Provide scoping and engineering estimate of projects and tasks.
• Create accurate work plans for medium or large projects that may require
cross-functional resources; identifying risks, constraints and assumptions
• Act as a programmer, integrator, and analyst for complex and technically
difficult assignments
• Create integration test plans, test conditions and expected test results
• Prepare project status reports
• Participate in integration testing, build test cases, and ensure quality
of test results
• Support an application or group of applications, including production
on-call responsibilities
• Perform peer code reviews for conformance to standards
• Act as a technical mentor to others; train staff
• Create and maintain appropriate documentation
• Consistently apply Information Technology software standards and help to
establish department specific standards
*Qualifications:*
• 6+ years experience with OO design and development, Java/J2EE
• 3+ years experience with Web/Application servers including Websphere,
Tomcat, and Apache
• Experience with the full software development lifecycle including project
initiation, requirements analysis, technical design, procedure development &
testing, deployment, maintenance/support, and transition phases (Agile,
SDLC, XP, etc.)
• Strong understanding of design patterns.
• Experience with HTML, CSS, JavaScript/JQuery/DOJO, AJAX
• Experience with SOA (SOAP, REST, etc…)
• Strong understanding of database concepts and SQL.
• Experience working in both a Windows and UNIX/Linux development
environment
• Experience developing and maintaining Internet retail/commerce thin-client
applications
• Experience building complex, high traffic, high performance web
applications
• Ability to lead and motivate others
• Ability to efficiently manage system critical resources
• Strong verbal and written communication skills. Ability to interact
professionally with all levels of the organization
• Proven task and time management skills
• Demonstrated initiative and follow-through
• Strong customer service skills/orientation
• Experience with open source technologies/frameworks including Sprint,
STRUTS, Hibernate, Velocity… a plus

*
-
*



*WCS ARCHITECT*
*DESCRIPTION*
We are looking for a WCS Architect to lead a team taking over a live WCS
implementation.  The Architect will:
1) Lead the effort to assess the state of the existing code
2) Make recommendations for improvement
3) Work with Project Managers and Business to prioritize work
4) Oversee team's work coding
5) Set up and monitor meaningful code reviews
6) Make sure team performs adequate unit tests
7) Hold team meetings to track progress of project
8) Maintain strong relationship with management and escalate issues promptly
as appropriate

*REQUIRED SKILLS*
Strong WebSphere Commerce Server experience
Familiarity with WCS administration
Strong project leadership experience
Solid SQL knowledge
Strong communication skills
Strong troubleshooting abilities

*DESIRED SKILLS*
Familiarity with Sterling Order Management System
Experience with SVN administration
Familiarity/experience with performance tuning

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[saurabh singh]

Agree with logic king...Moreover have you thouht of using maps?That will
improove your code's efficiency(With respect to current code) and also make
it shorter,
On Mon, Jun 6, 2011 at 5:12 PM, Logic King wrote:

> How can you assume that team name cannot be other than these.where in
> the question is written that only these teams will constitute the last 16.
>
> i hope you got my point and your mistake as well !!
>
> On Mon, Jun 6, 2011 at 4:28 AM, PRAMENDRA RATHi rathi  > wrote:
>
>>
>> no, i am getting wrong answer again with this logic..
>>
>> it is my code::
>>
>> int main()
>> {
>> register int test,i,j,winner=0,g1,g2;
>> string s1,s2;
>> string
>> team[16]={"ARG","BEL","BRZ","CAM","COL","CRC","CZE","ENG","GER","IRE","ITA","NET","ROM","SPA","URU","YUG"};
>>
>> cin >>test;
>> while(test--)
>> {
>> int point[16]={0};
>> for(j=0;j<16;j++)
>> {
>> cin>>s1>>s2>>g1>>g2;
>> if(g1>g2)
>> {
>> for(i=0;i<16;i++)
>> {
>> if(s1==team[i])
>> {point[i]++;break;}
>> }
>> }
>> else
>> {
>> for(i=0;i<16;i++)
>> {
>> if(s2==team[i])
>> {point[i]++;break;}
>> }
>> }
>>
>> }
>> int big=0;
>> for(i=0;i<16;i++)
>>
>> { cout<<"team "<> if(point[i]==4){cout<>
>> }
>>
>> return 0;
>>
>> }
>>
>>
>> On Mon, Jun 6, 2011 at 1:49 PM, nicks  wrote:
>>
>>> @parmendra..yeah u r right what's ur problem u r not able to implement it
>>> r whatonly winner will win 4 matches runner and 3rd posn will win 3
>>> match each...
>>>
>>>
>>> On Mon, Jun 6, 2011 at 12:47 AM, arun kumar  wrote:
>>>
 any team which has nt lost a match will win

 On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
  wrote:
 > i am thinking that the team with win point 4 will be the winner ..
 > is this wrong?
 >
 > https://www.spoj.pl/problems/SBETS/
 >
 >
 > because there are only 16 match 8+4+2+1(final) +1(for  runner up)
 > so any team can play at max 4 match.
 >
 > --
 > You received this message because you are subscribed to the Google
 Groups
 > "Algorithm Geeks" group.
 > To post to this group, send email to algogeeks@googlegroups.com.
 > To unsubscribe from this group, send email to
 > algogeeks+unsubscr...@googlegroups.com.
 > For more options, visit this group at
 > http://groups.google.com/group/algogeeks?hl=en.
 >

 --
 You received this message because you are subscribed to the Google
 Groups "Algorithm Geeks" group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.


>>> --
>>>  You received this message because you are subscribed to the Google
>>> Groups "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>>  You received this message because you are subscribed to the Google
>> Groups "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Functional SAP BA - FICO // Nashville, Tennessee // 3+ months contract

[sohail panzer]

Dear Professional,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
*Please reply at soh...@panzersolutions.com *
   *   **HOT
HOT   HOT!!!*

Title  :   Functional SAP BA - FICO
Location   :   Nashville, Tennessee
Duration  :   3+ months contract


Business Analyst that can complete research in order to accurately and
timely document assigned functional specs, containing business requirements,
business rules & data mapping.  This includes SAP & system integration in
the following areas:
Logistics (SAP integration with TMS & WMS)
MDD/TDD (Master & Transactional data movements)
Material Master
They want heavy reporting and inventory mgmt




Thank you,

Sohail Khan | Technical Recruiter
Panzer Solutions LLc
45 Stuart Ave, K
Norwalk, CT 06850 USA
Voice: 203-813-2052
soh...@panzersolutions.com
URL: www.panzersolutions.com

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[subramania jeeva]

@Gaurav Aggarwal
Obviously O(n^2) worst case if we use ordinary quick sort with slight
modification(Best case O(n))...
But quick sort can also be done by taking median as element for partition
instead of taking first or last element which will take O(nlgn) worst case
complexity...
But to do the given problem median of median algorithm is best.. It will
take O(n) in worst case...

1. Divide the n elements of input into n/5 groups
2. Find median of each group by insertion sort(performs well for small
inputs) and pick the median for each each group.
3. Repeat steps (1) and (2) repeatedly to find a single median
4.partition the array using that median. such that  k elements are in lower
partition and n-k elements are in higher side of partition.(use the
partition insuch a way that smallest elements are on higher side of
partition and largest elements are on lower side of partition)

5. If index i==k(ith largest element) then return a[i].. else recurse steps
1 to 5 such that (if i>k then use k to r) (else use p to k)(p is the
starting index and r is ending index)..

I hope It explains the code given by piyush sinha..








Cheers
  ~ Jeeva ~

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Windows Engineer // Miami Florida // 8 week contract

[sohail panzer]

 Dear Professional,
Hope you are doing well.
I am a technical recruiter with Panzer Solutions LLC Software Implementing
and IT consulting company located in CT. Please go through the Job
Description and send me your updated resume with contact information.
* Please reply at soh...@panzersolutions.com*
 * **HOT
HOT   HOT!!!
*
Title  :   Windows Engineer
Location   :   Miami Florida
Duration  :8 week contract
Pay rate   :$40 corp to corp
Start Date:6.13.2011


   ONLY ONE INTERVIEW ROUND

WINDOWS 2008
Upgrade domain controllers from 2003-2008
Install windows 2008 server operating system
Periodically install windows patches using Bigfix
Install sophos antivirus on window servers
Secure O/S based on corporate security guidelines
Implement departmental backup processes on servers
Performing testing of environment.


Thank you,

Sohail Khan | Technical Recruiter
Panzer Solutions LLc
45 Stuart Ave, K
Norwalk, CT 06850 USA
Voice: 203-813-2052
soh...@panzersolutions.com
URL: www.panzersolutions.com

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[Gaurav Aggarwal]

@subramania jeeva
i think the your algorithm will have O(n^2) worst case when the list is
sorted..

On Mon, Jun 6, 2011 at 7:22 PM, subramania jeeva
wrote:

> Tree formation will also take O(nlgn).. For inserting each node It'll take
> O(lgn).. so for inserting n nodes It'll take O(nlgn) time..:)
>
>
>
>
>
>
>
> Cheers
>   ~ Jeeva ~
>
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Gaurav Aggarwal
SCJP

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Array Merge Problem

[ross]

@aakash Johari:
Let a and b be the 2 arrays.
At each stage of the process, if an element of A is greater than B,
then swap the largest element of A with the smallest element of B
and adjust pointers.

A : 2 4 15 12
B : 0.2 1  33 44

Now, 2>0, therefore swap 0 with 12..
Every step of the process, gets in the smallest elemnt of A and swaps
it
with the largest element of B.

Hope its clear.


On Jun 6, 11:15 am, Aakash Johari  wrote:
> @ross: I couldn't get reddy's solution. Please explain.
>
> On Sun, Jun 5, 2011 at 10:50 PM, Deepak Jha wrote:
>
>
>
>
>
>
>
>
>
> > the below solution should work given the input array is sorted ( I am
> > assuming ascending order)
> > void rearrangeArray(int[] a, int[] b){
> > int m = a.length;
> >  int n = b.length;
> > int i = m - 1;
> > int j = 0;
> >  while((i >=0) && (j <= n-1)){
> > if(a[i] > b[j]){
> > int temp = a[i];
> >  a[i] = b[j];
> > b[j] = temp;
> > }
> >  i--;
> > j++;
> > }
> >  }
>
> > On Sat, Jun 4, 2011 at 2:29 PM, ross  wrote:
>
> >> Hi Rohit & all,
> >> Sorry that there was a small typo in the 'n' 'm' texts.
> >> The example given by me is anyway the correct one.
> >> Sravan Reddy's solution worked fine.
>
> >> On Jun 4, 10:08 am, rohit  wrote:
> >> > i think solution would be like this
>
> >> > eg:
> >> > A : 1 2 3 B: 0 1.5 4 5 9
> >> > Output:
> >> > A can contain any combination of nos 0,1,1.5
> >> > and B should contain 2 3 4 5 9 (in any order.)
>
> >> > this example is given by ROSS itself.
>
> >> > so sravanreddy solution is right , correct me if i'm wrong.
>
> >> > On Jun 3, 8:07 pm, bittu  wrote:
>
> >> > > @sravanreddy...logical bugs  if A is size of n & B is size m from your
> >> > > example  assuming n >> > > only capacity of n elements & didn't allocate memory so these elements
> >> > > initialized by INT_MIN for m-n nodes so thatarrayA can hold m
> >> > > smallest elements then what r u swapping u dude..isn't garbage
> >> > > value ?? you will get at 1st step only just run it ?? in you algo
> >> > > A_End=m-1(which 4th position inArraythat DNE)..?? & also you have to
> >> > > free memory for  m-n  inarrayB as it contains n largest elements .
>
> >> > > take
> >> > > A= 1,2,3 n=3
> >> > > B= 0,1,4,5,9 m=5
>
> >> > > after allocating memory toArrayA  for  m-n elements A will looks
> >> > > likes 1 2 3 INT_Max INT_Max
> >> > > now what you wants A should contains m smallest elements & B have n
> >> > > largest elements
> >> > > so O/P should be  A=1,2,3,1,0 & B=INT_Max,INT_Max,4,5,9 now free
> >> > > memory used by 1st elements inarrayB so that A will represent M
> >> > > smallest elements & B will have n Largest elements
>
> >> > > so that above will work.
>
> >> > > Hope I am Correct let me know if any issue with explanation
>
> >> > > Thanks
> >> > > Shashank>>"The Best Way To Escape From Theproblemis To Solve It"
> >> > > CSE,BIT Mesra
>
> >> --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> >  --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> -Aakash Johari
> (IIIT Allahabad)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[shashankreddy509]

thanks Arpit

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/VXJkN2RnOTBnOU1K.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[subramania jeeva]

Tree formation will also take O(nlgn).. For inserting each node It'll take
O(lgn).. so for inserting n nodes It'll take O(nlgn) time..:)







Cheers
  ~ Jeeva ~

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[Ashish Goel]

why not form a tree with each node keeping count of elements smaller than
it, i.e nodes in left subtree.
so tree formation is O(n) and tree search is O(logn)


Best Regards
Ashish Goel
"Think positive and find fuel in failure"
+919985813081
+919966006652


On Mon, Jun 6, 2011 at 12:15 PM, the coder  wrote:

> hi friendz
>
> given an array  how to find the k th largest element  in O(N)
> complexity.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[subramania jeeva]

Use modified quick sort which will stop when the partition function returns
the position k..:)









Cheers
  ~ Jeeva ~

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Efficient Recursion algorithm for Fibonacci series.

[saurabh singh]

Sorry line number 7 is a[n]=fibo(n-1)+fibo(n-2);

On Mon, Jun 6, 2011 at 6:25 PM, saurabh singh  wrote:

> long a[1000]={0,1};
> long fibo(long n)
> {
> if(a[n]) return a[n];
> else
> {
> a[n]=fibo(n-1)+sum(n);
> return a[n];
>
> }
> }
>
> On Mon, Jun 6, 2011 at 6:19 PM, Aakash Johari wrote:
>
>> Memoize your solution for nth fibonacci and use this memoized value in
>> further computations.
>>
>>
>> On Mon, Jun 6, 2011 at 5:42 AM, kumar vr  wrote:
>>
>>> The Fibonacci series Recursion using
>>> F(n) = F(n-1) + F(n-2)
>>> Will of exponential complexity.
>>> This occurs because each of the Term is calculated twice
>>> eg
>>> F5= F4+F3
>>> F4= F3+F2.
>>>
>>> So F3 calculation is done twice.
>>>
>>> Can someone come up with an algorithm to minimize these computation and
>>> come up with efficent algorithm.
>>>
>>>
>>>
>>>  --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> -Aakash Johari
>> (IIIT Allahabad)
>>
>>
>>
>>
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Saurabh Singh
> B.Tech (Computer Science)
> MNNIT ALLAHABAD
>
>
>


-- 
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Efficient Recursion algorithm for Fibonacci series.

[saurabh singh]

long a[1000]={0,1};
long fibo(long n)
{
if(a[n]) return a[n];
else
{
a[n]=fibo(n-1)+sum(n);
return a[n];
}
}

On Mon, Jun 6, 2011 at 6:19 PM, Aakash Johari  wrote:

> Memoize your solution for nth fibonacci and use this memoized value in
> further computations.
>
>
> On Mon, Jun 6, 2011 at 5:42 AM, kumar vr  wrote:
>
>> The Fibonacci series Recursion using
>> F(n) = F(n-1) + F(n-2)
>> Will of exponential complexity.
>> This occurs because each of the Term is calculated twice
>> eg
>> F5= F4+F3
>> F4= F3+F2.
>>
>> So F3 calculation is done twice.
>>
>> Can someone come up with an algorithm to minimize these computation and
>> come up with efficent algorithm.
>>
>>
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> -Aakash Johari
> (IIIT Allahabad)
>
>
>
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Efficient Recursion algorithm for Fibonacci series.

[Aakash Johari]

Memoize your solution for nth fibonacci and use this memoized value in
further computations.

On Mon, Jun 6, 2011 at 5:42 AM, kumar vr  wrote:

> The Fibonacci series Recursion using
> F(n) = F(n-1) + F(n-2)
> Will of exponential complexity.
> This occurs because each of the Term is calculated twice
> eg
> F5= F4+F3
> F4= F3+F2.
>
> So F3 calculation is done twice.
>
> Can someone come up with an algorithm to minimize these computation and
> come up with efficent algorithm.
>
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
-Aakash Johari
(IIIT Allahabad)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Efficient Recursion algorithm for Fibonacci series.

[kumar vr]

The Fibonacci series Recursion using
F(n) = F(n-1) + F(n-2)
Will of exponential complexity.
This occurs because each of the Term is calculated twice
eg
F5= F4+F3
F4= F3+F2.

So F3 calculation is done twice.

Can someone come up with an algorithm to minimize these computation and come
up with efficent algorithm.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[Logic King]

How can you assume that team name cannot be other than these.where in
the question is written that only these teams will constitute the last 16.

i hope you got my point and your mistake as well !!

On Mon, Jun 6, 2011 at 4:28 AM, PRAMENDRA RATHi rathi
wrote:

>
> no, i am getting wrong answer again with this logic..
>
> it is my code::
>
> int main()
> {
> register int test,i,j,winner=0,g1,g2;
> string s1,s2;
> string
> team[16]={"ARG","BEL","BRZ","CAM","COL","CRC","CZE","ENG","GER","IRE","ITA","NET","ROM","SPA","URU","YUG"};
>
> cin >>test;
> while(test--)
> {
> int point[16]={0};
> for(j=0;j<16;j++)
> {
> cin>>s1>>s2>>g1>>g2;
> if(g1>g2)
> {
> for(i=0;i<16;i++)
> {
> if(s1==team[i])
> {point[i]++;break;}
> }
> }
> else
> {
> for(i=0;i<16;i++)
> {
> if(s2==team[i])
> {point[i]++;break;}
> }
> }
>
> }
> int big=0;
> for(i=0;i<16;i++)
>
> { cout<<"team "< if(point[i]==4){cout<
> }
>
> return 0;
>
> }
>
>
> On Mon, Jun 6, 2011 at 1:49 PM, nicks  wrote:
>
>> @parmendra..yeah u r right what's ur problem u r not able to implement it
>> r whatonly winner will win 4 matches runner and 3rd posn will win 3
>> match each...
>>
>>
>> On Mon, Jun 6, 2011 at 12:47 AM, arun kumar  wrote:
>>
>>> any team which has nt lost a match will win
>>>
>>> On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
>>>  wrote:
>>> > i am thinking that the team with win point 4 will be the winner ..
>>> > is this wrong?
>>> >
>>> > https://www.spoj.pl/problems/SBETS/
>>> >
>>> >
>>> > because there are only 16 match 8+4+2+1(final) +1(for  runner up)
>>> > so any team can play at max 4 match.
>>> >
>>> > --
>>> > You received this message because you are subscribed to the Google
>>> Groups
>>> > "Algorithm Geeks" group.
>>> > To post to this group, send email to algogeeks@googlegroups.com.
>>> > To unsubscribe from this group, send email to
>>> > algogeeks+unsubscr...@googlegroups.com.
>>> > For more options, visit this group at
>>> > http://groups.google.com/group/algogeeks?hl=en.
>>> >
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>> --
>>  You received this message because you are subscribed to the Google
>> Groups "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
>  You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[PRAMENDRA RATHi rathi]

no, i am getting wrong answer again with this logic..

it is my code::

int main()
{
register int test,i,j,winner=0,g1,g2;
string s1,s2;
string
team[16]={"ARG","BEL","BRZ","CAM","COL","CRC","CZE","ENG","GER","IRE","ITA","NET","ROM","SPA","URU","YUG"};

cin >>test;
while(test--)
{
int point[16]={0};
for(j=0;j<16;j++)
{
cin>>s1>>s2>>g1>>g2;
if(g1>g2)
{
for(i=0;i<16;i++)
{
if(s1==team[i])
{point[i]++;break;}
}
}
else
{
for(i=0;i<16;i++)
{
if(s2==team[i])
{point[i]++;break;}
}
}

}
int big=0;
for(i=0;i<16;i++)

{ cout<<"team "< wrote:

> @parmendra..yeah u r right what's ur problem u r not able to implement it r
> whatonly winner will win 4 matches runner and 3rd posn will win 3 match
> each...
>
>
> On Mon, Jun 6, 2011 at 12:47 AM, arun kumar  wrote:
>
>> any team which has nt lost a match will win
>>
>> On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
>>  wrote:
>> > i am thinking that the team with win point 4 will be the winner ..
>> > is this wrong?
>> >
>> > https://www.spoj.pl/problems/SBETS/
>> >
>> >
>> > because there are only 16 match 8+4+2+1(final) +1(for  runner up)
>> > so any team can play at max 4 match.
>> >
>> > --
>> > You received this message because you are subscribed to the Google
>> Groups
>> > "Algorithm Geeks" group.
>> > To post to this group, send email to algogeeks@googlegroups.com.
>> > To unsubscribe from this group, send email to
>> > algogeeks+unsubscr...@googlegroups.com.
>> > For more options, visit this group at
>> > http://groups.google.com/group/algogeeks?hl=en.
>> >
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Google Puzzle

[Piyush Sinha]

On a empty chessboard, a horse starts from a point( say location x,y) and it
starts moving randomly, but once it moves out of board, it cant come inside.
So what is the total probability that it stays within the board after N
steps.


-- 
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Microsoft ques : reverse of dutch national flag problem

[Ashish Goel]

solution when n is even


a1 a2 a3 a4 b1 b2 b3 b4

a1 a2 b1 b2 a3 a4 b3 b4
 
a1 b1 a2 b2 a3 b3 a4 b4
  


solution for odd yet to figure out




Best Regards
Ashish Goel
"Think positive and find fuel in failure"
+919985813081
+919966006652


On Sun, Jun 5, 2011 at 9:52 PM, Piyush Sinha wrote:

> Can we use recursion/internal stack memory???
>
> On 6/5/11, hary rathor  wrote:
> > it it is possible in order of  O(n )
> >
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> > http://groups.google.com/group/algogeeks?hl=en.
> >
> >
>
>
> --
> *Piyush Sinha*
> *IIIT, Allahabad*
> *+91-8792136657*
> *+91-7483122727*
> *https://www.facebook.com/profile.php?id=10655377926 *
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[Arpit Sood]

search about twin primes

On Mon, Jun 6, 2011 at 2:31 PM, shashankreddy509  wrote:

> can any one tell the logic of this problem..
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/TGc5eGkxUzhXLW9K.
>
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Regards,
Arpit Sood

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] 5th largest element

[Piyush Sinha]

Median of median algorithm will do the job...Its worst case performance
analysis is O(n).

The algorithm can be found in wikipedia (search for selection algorithm) but
it is sometimes found difficult to code for it..
I hope following pseudocode will do the job. I am doing it for general Kth
smallest element

*int select(int A[],int first, int last, int K) {*

*   n = last - first + 1; /* number of elements*/


   if( n < = 10 )
   {
   /* For Small n */
   sort A;
   return Kth smallest element;
 }
 else
 {

 numGroups = (n + 4 ) / 5; /* integer division, rounding up */

  int *S = new int[newgroups];

for i = 0 to numGroups-1
  {
 shift = i*5;
 /* A[first+shift] is the start of the group, A[first+shift+4] is end of
group */
  find median of A[first+shift .. first+shift+4] and store it into
another array S[i]; /*6 comparisons required*/
 }

   int element = select(S , 0, numGroups-1, numGroups/2);

int pivot_index = findelement (A,first,last,element); /*find the
index of the element*/

   int M = partition(A, first, last, pivot_index); /*returns the
position of Mth largest element/*

   if ((M+1) == K) {
return A[M]
   }
   else if ((M+1) >  K) {

  return (select(A, first, M-1, K));
  }
 else
 {
 return (select(A, M+1, last, K-M-1));
   }
}
}
*
On Mon, Jun 6, 2011 at 12:25 PM, Vipul Kumar  wrote:

> "This is called finding the k-th order statistic" study the topic from
> cormen its there.
>
> On Mon, Jun 6, 2011 at 12:15 PM, the coder  wrote:
> > hi friendz
> >
> > given an array  how to find the k th largest element  in O(N)
> > complexity.
> >
> > --
> > You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
> >
> >
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: 5th largest element

[shashankreddy509]

http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-four


check out this link u can find a video in that page have look at the video.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/Q1dYVHRUSXZTYUlK.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[shashankreddy509]

can any one tell the logic of this problem..

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/TGc5eGkxUzhXLW9K.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[nicks]

@parmendra..yeah u r right what's ur problem u r not able to implement it r
whatonly winner will win 4 matches runner and 3rd posn will win 3 match
each...

On Mon, Jun 6, 2011 at 12:47 AM, arun kumar  wrote:

> any team which has nt lost a match will win
>
> On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
>  wrote:
> > i am thinking that the team with win point 4 will be the winner ..
> > is this wrong?
> >
> > https://www.spoj.pl/problems/SBETS/
> >
> >
> > because there are only 16 match 8+4+2+1(final) +1(for  runner up)
> > so any team can play at max 4 match.
> >
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> > http://groups.google.com/group/algogeeks?hl=en.
> >
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Find The Next Number 6 june

[Arpit Sood]

138, 150


On Mon, Jun 6, 2011 at 1:02 PM, Lavesh Rawat  wrote:

> *Find The Next Number
>  *
> *
> *
> **
> *What are the next three numbers in this series?
>
> 4, 6, 12, 18, 30, 42, 60, 72, 102, 108, ?, ?, ?
> *
> *Update Your Answers at* : Click 
> Here
>
>
> Solution:
> Will be updated after 1 day
>
>
>
>
> --
>
> "Never explain yourself. Your friends don’t need it and
> your enemies won’t believe it" .
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Regards,
Arpit Sood

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] logic error:

[arun kumar]

any team which has nt lost a match will win

On Mon, Jun 6, 2011 at 1:12 PM, PRAMENDRA RATHi rathi
 wrote:
> i am thinking that the team with win point 4 will be the winner ..
> is this wrong?
>
> https://www.spoj.pl/problems/SBETS/
>
>
> because there are only 16 match 8+4+2+1(final) +1(for  runner up)
> so any team can play at max 4 match.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] logic error:

[PRAMENDRA RATHi rathi]

i am thinking that the team with win point 4 will be the winner ..
is this wrong?

https://www.spoj.pl/problems/SBETS/


because there are only 16 match 8+4+2+1(final) +1(for  runner up)
so any team can play at max 4 match.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] [brain teaser ] Find The Next Number 6 june

[Lavesh Rawat]

*Find The Next Number
 *
*
*
**
*What are the next three numbers in this series?

4, 6, 12, 18, 30, 42, 60, 72, 102, 108, ?, ?, ?
*
*Update Your Answers at* : Click
Here


Solution:
Will be updated after 1 day




-- 

"Never explain yourself. Your friends don’t need it and
your enemies won’t believe it" .

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Array Merge Problem

[Aakash Johari]

@ross: I couldn't get reddy's solution. Please explain.

On Sun, Jun 5, 2011 at 10:50 PM, Deepak Jha wrote:

> the below solution should work given the input array is sorted ( I am
> assuming ascending order)
> void rearrangeArray(int[] a, int[] b){
> int m = a.length;
>  int n = b.length;
> int i = m - 1;
> int j = 0;
>  while((i >=0) && (j <= n-1)){
> if(a[i] > b[j]){
> int temp = a[i];
>  a[i] = b[j];
> b[j] = temp;
> }
>  i--;
> j++;
> }
>  }
>
> On Sat, Jun 4, 2011 at 2:29 PM, ross  wrote:
>
>> Hi Rohit & all,
>> Sorry that there was a small typo in the 'n' 'm' texts.
>> The example given by me is anyway the correct one.
>> Sravan Reddy's solution worked fine.
>>
>> On Jun 4, 10:08 am, rohit  wrote:
>> > i think solution would be like this
>> >
>> > eg:
>> > A : 1 2 3 B: 0 1.5 4 5 9
>> > Output:
>> > A can contain any combination of nos 0,1,1.5
>> > and B should contain 2 3 4 5 9 (in any order.)
>> >
>> > this example is given by ROSS itself.
>> >
>> > so sravanreddy solution is right , correct me if i'm wrong.
>> >
>> > On Jun 3, 8:07 pm, bittu  wrote:
>> >
>> >
>> >
>> >
>> >
>> >
>> >
>> > > @sravanreddy...logical bugs  if A is size of n & B is size m from your
>> > > example  assuming n> > > only capacity of n elements & didn't allocate memory so these elements
>> > > initialized by INT_MIN for m-n nodes so thatarrayA can hold m
>> > > smallest elements then what r u swapping u dude..isn't garbage
>> > > value ?? you will get at 1st step only just run it ?? in you algo
>> > > A_End=m-1(which 4th position inArraythat DNE)..?? & also you have to
>> > > free memory for  m-n  inarrayB as it contains n largest elements .
>> >
>> > > take
>> > > A= 1,2,3 n=3
>> > > B= 0,1,4,5,9 m=5
>> >
>> > > after allocating memory toArrayA  for  m-n elements A will looks
>> > > likes 1 2 3 INT_Max INT_Max
>> > > now what you wants A should contains m smallest elements & B have n
>> > > largest elements
>> > > so O/P should be  A=1,2,3,1,0 & B=INT_Max,INT_Max,4,5,9 now free
>> > > memory used by 1st elements inarrayB so that A will represent M
>> > > smallest elements & B will have n Largest elements
>> >
>> > > so that above will work.
>> >
>> > > Hope I am Correct let me know if any issue with explanation
>> >
>> > > Thanks
>> > > Shashank>>"The Best Way To Escape From Theproblemis To Solve It"
>> > > CSE,BIT Mesra
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
-Aakash Johari
(IIIT Allahabad)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.