Question: Given an array of integers A [ 1 . . . n ] , we need to push all square num - bers in the

Given an array of integers A[1... n], we need to push all square num- bers in the array to the front of the array and the non-square numbers to the end. Assume that you are given a function ISPERFECTSQUARE(k) that checks if a given number k is a square number or not in O (1) time.
(i) DesignaO(n2)time,O(1)extraspacealgorithmGROUPING-NAIVE(A[1...n])to solve the problem.
(ii) Design a \Theta (n) time, O (n) extra space algorithm GROUPING-BETTER(A[1... n]) to solve the problem.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!