How to reduce a given series expression to an algebraic expression? [on hold]












-1












$begingroup$


I need to reduce the given series expression to an algebraic expression, without summation.



Then I have to express the performance of the algebraic expression in Big O Notation.



I am mainly confused about the first part. I am not too sure how to interpret the series expression to an algebraic expression. An explanation would be great! Thanks.



Algorithm of:



for ( j = 0; j < n; j++ )

{

for ( k = j; k < n; k++ )

{



}

}


will result in a number of iterations of given by the expression:



= n + (n-1) + (n-2) + (n-3) + ........ + (n - n)










share|improve this question







New contributor




M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$



put on hold as off-topic by Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl 1 hour ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "Code not implemented or not working as intended: Code Review is a community where programmers peer-review your working code to address issues such as security, maintainability, performance, and scalability. We require that the code be working correctly, to the best of the author's knowledge, before proceeding with a review." – Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl

If this question can be reworded to fit the rules in the help center, please edit the question.





















    -1












    $begingroup$


    I need to reduce the given series expression to an algebraic expression, without summation.



    Then I have to express the performance of the algebraic expression in Big O Notation.



    I am mainly confused about the first part. I am not too sure how to interpret the series expression to an algebraic expression. An explanation would be great! Thanks.



    Algorithm of:



    for ( j = 0; j < n; j++ )

    {

    for ( k = j; k < n; k++ )

    {



    }

    }


    will result in a number of iterations of given by the expression:



    = n + (n-1) + (n-2) + (n-3) + ........ + (n - n)










    share|improve this question







    New contributor




    M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$



    put on hold as off-topic by Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl 1 hour ago


    This question appears to be off-topic. The users who voted to close gave this specific reason:


    • "Code not implemented or not working as intended: Code Review is a community where programmers peer-review your working code to address issues such as security, maintainability, performance, and scalability. We require that the code be working correctly, to the best of the author's knowledge, before proceeding with a review." – Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl

    If this question can be reworded to fit the rules in the help center, please edit the question.



















      -1












      -1








      -1





      $begingroup$


      I need to reduce the given series expression to an algebraic expression, without summation.



      Then I have to express the performance of the algebraic expression in Big O Notation.



      I am mainly confused about the first part. I am not too sure how to interpret the series expression to an algebraic expression. An explanation would be great! Thanks.



      Algorithm of:



      for ( j = 0; j < n; j++ )

      {

      for ( k = j; k < n; k++ )

      {



      }

      }


      will result in a number of iterations of given by the expression:



      = n + (n-1) + (n-2) + (n-3) + ........ + (n - n)










      share|improve this question







      New contributor




      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I need to reduce the given series expression to an algebraic expression, without summation.



      Then I have to express the performance of the algebraic expression in Big O Notation.



      I am mainly confused about the first part. I am not too sure how to interpret the series expression to an algebraic expression. An explanation would be great! Thanks.



      Algorithm of:



      for ( j = 0; j < n; j++ )

      {

      for ( k = j; k < n; k++ )

      {



      }

      }


      will result in a number of iterations of given by the expression:



      = n + (n-1) + (n-2) + (n-3) + ........ + (n - n)







      c++






      share|improve this question







      New contributor




      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question







      New contributor




      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question






      New contributor




      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 2 hours ago









      M. CowM. Cow

      1




      1




      New contributor




      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      M. Cow is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




      put on hold as off-topic by Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl 1 hour ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "Code not implemented or not working as intended: Code Review is a community where programmers peer-review your working code to address issues such as security, maintainability, performance, and scalability. We require that the code be working correctly, to the best of the author's knowledge, before proceeding with a review." – Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl

      If this question can be reworded to fit the rules in the help center, please edit the question.







      put on hold as off-topic by Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl 1 hour ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "Code not implemented or not working as intended: Code Review is a community where programmers peer-review your working code to address issues such as security, maintainability, performance, and scalability. We require that the code be working correctly, to the best of the author's knowledge, before proceeding with a review." – Snowhawk, Sᴀᴍ Onᴇᴌᴀ, Stephen Rauch, rolfl

      If this question can be reworded to fit the rules in the help center, please edit the question.






















          0






          active

          oldest

          votes

















          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes

          Popular posts from this blog

          How to make a Squid Proxy server?

          第一次世界大戦

          Touch on Surface Book