c code:
#include stdio.h
#include stdlib.h
int printp(int*);
int print(int*);
int main (void)
{
int *arr=NULL,*pi=NULL;
int n,p,pv;
int i=0;
char a;
printf(enter the number: ); scanf(%d, n);
// init mem
pi = malloc(n*sizeof(int));
// lets call it arr
arr = pi;
Vinod. Can you please mention steps for the O(n^2) solution that you
have thought of.
On Dec 2, 9:50 am, Vinoth Kumar vinoth.ratna.ku...@gmail.com wrote:
No need for the code guys.
Can u give me a algo or pseudo code for this problem.
I can think of a soln of O(n^2) but i need a algo for
