Comments on: Couldn’t come up with an appropriate title ;-) http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/ Not just another WordPress.com weblog Thu, 19 Jun 2008 00:17:22 +0000 http://wordpress.com/ hourly 1 By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-78 Sreelu Thu, 20 Mar 2008 12:44:35 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-78 I could finally post the code. the <code> tags are not working.. even after placing the code in <code> tags.. indentation is lost, greater than and lesser than symbols are getting messed up.. finally used  , <, > entities to get the code correctly posted. Would like to know if there is a better way.. I could finally post the code.
the <code> tags are not working..
even after placing the code in <code> tags.. indentation is lost, greater than and lesser than symbols are getting messed up..

finally used  , <, > entities to get the code correctly posted. Would like to know if there is a better way..

]]> By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-39 Sreelu Mon, 03 Mar 2008 14:28:54 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-39 trying once more.. <code> min = A[0]; //stores the min element found in the array so far B[0] = -1; index[0] = -1; /*for the elements being stored in B, their original indexes in A will be stored in index[n] array */ for ( i = 1; i < n; i++) {       if (A[i] < min) {            B[i] = -1;            index[i] = -1;            min = A[i];       }       else if ( A[i-1] < A[i] ) {             index[i] = i-1;             B[i] = A[i-1];       }       else {           for (k = i-1; k > 0; k = index[k] ) {                  if (B[k] < A[i] ) {                       index[i] = index[k];                       B[i] = B[k];                       break;                 }           }       } } </code> trying once more..


min = A[0]; //stores the min element found in the array so far
B[0] = -1;
index[0] = -1; /*for the elements being stored in B, their original indexes in A will be stored in index[n] array */

for ( i = 1; i < n; i++) {
      if (A[i] < min) {
           B[i] = -1;
           index[i] = -1;
           min = A[i];
      }
      else if ( A[i-1] < A[i] ) {
            index[i] = i-1;
            B[i] = A[i-1];
      }
      else {
          for (k = i-1; k > 0; k = index[k] ) {
                 if (B[k] < A[i] ) {
                      index[i] = index[k];
                      B[i] = B[k];
                      break;
                }
          }
      }
}

]]> By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-38 Sreelu Mon, 03 Mar 2008 14:26:13 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-38 hey there is some problem.. will send the code to naresh to post.. hey there is some problem.. will send the code to naresh to post..

]]> By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-37 Sreelu Mon, 03 Mar 2008 14:24:20 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-37 oops! thats a mess.. some of the lines got deleted.. posting again.. min = A[0]; B[0] = -1; index[0] = -1; for ( i = 1; i < n; i++) {       if (A[i] < min) {            B[i] = -1;            index[i] = -1;            min = A[i];       }       else if ( A[i-1] <A> 0; k = index[k] ) {                 if (B[k] < A[i] ) {                      index[i] = index[k];                      B[i] = B[k];                      break;                 }           }       } } oops! thats a mess.. some of the lines got deleted.. posting again..

min = A[0];
B[0] = -1;
index[0] = -1;

for ( i = 1; i < n; i++) {
      if (A[i] < min) {
           B[i] = -1;
           index[i] = -1;
           min = A[i];
      }
      else if ( A[i-1] 0; k = index[k] ) {
                if (B[k] < A[i] ) {
                     index[i] = index[k];
                     B[i] = B[k];
                     break;
                }
          }
      }
}

]]> By: srawon http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-36 srawon Mon, 03 Mar 2008 12:28:22 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-36 i didn't get it.. esp the "else if" part. can u pls repost ur code? i didn’t get it.. esp the “else if” part.
can u pls repost ur code?

]]> By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-35 Sreelu Mon, 03 Mar 2008 10:30:44 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-35 If we can maintain another array which stores indexes of elements getting stored in B, we can keep checking B instead of A for finding the largest index such that B[k] < A[i] min = A[0]; //stores the min element found in the array so far B[0] = -1; index[0] = -1; /*for the elements being stored in B, their original indexes in A will be stored in index[n] array */ for ( i = 1; i < n; i++) {       if (A[i] < min) {            B[i] = -1;            index[i] = -1;            min = A[i];       }       else if ( A[i-1] <A> 0; k = index[k] ) {                  if (B[k] < A[i] ) {                       index[i] = index[k];                       B[i] = B[k];                       break;                 }           }       } } If we can maintain another array which stores indexes of elements getting stored in B, we can keep checking B instead of A for finding the largest index such that B[k] < A[i]

min = A[0]; //stores the min element found in the array so far
B[0] = -1;
index[0] = -1; /*for the elements being stored in B, their original indexes in A will be stored in index[n] array */

for ( i = 1; i < n; i++) {
      if (A[i] < min) {
           B[i] = -1;
           index[i] = -1;
           min = A[i];
      }
      else if ( A[i-1] 0; k = index[k] ) {
                 if (B[k] < A[i] ) {
                      index[i] = index[k];
                      B[i] = B[k];
                      break;
                }
          }
      }
}

]]> By: Sreelu http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-34 Sreelu Mon, 03 Mar 2008 08:27:45 +0000 http://404blognotfound.wordpress.com/2008/02/29/couldnt-come-up-with-an-appropriate-title/#comment-34 Can we maintain another array of 'n' elements in addition to arrays A and B? space used will be 3n which is still O(n).. is this ok? Can we maintain another array of ‘n’ elements in addition to arrays A and B? space used will be 3n which is still O(n).. is this ok?

]]>