dianadijan
BAN USERimporting program 1 inside program 2 - in case of user space
export (function pointer)- in case of kernel space
for i=0 to 256
for j=0 to 256
for k=0 to 256
for m=0 to 256
if file contains i||j||k||m, then print(i.j.k.m)
time complexity is O(n), n - number of ip address in the file
O(n) recursive solution:
numzero(0 to n)= 1+numzero(1 to n)
int zerocount(array, startindex)
{
if(array[startindex]==1) return 0;
else
return 1+zerocount(array,startindex+1);
}
}
Tim, can u pls explain the pseudocode for the code?
- dianadijan September 08, 2014Perm(n) = Perm(n-1) +charat(n)
eg: Perm(235) = Perm(23) + 5
= [Perm(2) +3 ] +5
=2 + 3 + 5
= (2,3) (23) + 5
= (2,3,5) (2,35) (23,5)
= bce , invalid, we
cannot we use a database with table 'Product-Person' containing map of which product is viewed by which person.
Then its a simple SQL query to display products viewed people who also viewed current product
select product from product-person
where person in (select person from product-person where product='A')
for (i=0 to 1000/20-1)
{
for(j=0 to 19)
{
arr[j][i]=A[i*20+j]
}
}
1/ 10^8
- dianadijan May 07, 2015