i am new to C++ these are my assingnments can any one help me how to start and solve

[rajashekharthota]

HI all,
Can any one help me here these are my assignments i am new to C++.
Pls help find solution to these

1.Suppose that each row of an nxn array A consists of 1's and 0's such that,in an row of A,all the 1's come before any 0's in that row.Assuming A is already in memory,describe a method running in O(n) time (not O(n^2) time ) for finding the row of A that contains the most 1's.


2.Consider an extend able table that supports both add and remove methods,has defined in the previous exercise.Moreover,suppose we grow the underlined array implementing the table by doubling its capacity any time we need to increase the size of this array,and we shrink the underlined array by half any time the number of (actual) elements in the table dips below N/4,where N is the current capacity of the array show that a sequence of n add and remove methods,starting from an array with capacity N=1,takes O(n) time.

Thanks in Advance

[r035198x]

HI all,
Can any one help me here these are my assignments i am new to C++.
Pls help find solution to these

1.Suppose that each row of an nxn array A consists of 1's and 0's such that,in an row of A,all the 1's come before any 0's in that row.Assuming A is already in memory,describe a method running in O(n) time (not O(n^2) time ) for finding the row of A that contains the most 1's.


2.Consider an extend able table that supports both add and remove methods,has defined in the previous exercise.Moreover,suppose we grow the underlined array implementing the table by doubling its capacity any time we need to increase the size of this array,and we shrink the underlined array by half any time the number of (actual) elements in the table dips below N/4,where N is the current capacity of the array show that a sequence of n add and remove methods,starting from an array with capacity N=1,takes O(n) time.

Thanks in Advance

What have you done so far?