Rewrite insert() function - list index out of range












1















I'm essentially trying to re-create a version of the insert() function for a homework assignment.
I've written the following function:



def insert_value(my_list, value, insert_position):
list_copy =

if insert_position < 0:
insert_position = 0

if insert_position >= len(my_list):
insert_position = len(my_list) - 1

i = 0
while i < len(my_list) + 1:
while i < insert_position:
list_copy.append(my_list[i])
i += 1

while i == insert_position:
list_copy.append(value)
i += 1

while i > insert_position:
list_copy.append(my_list[i-1])
i += 1

return list_copy


I get the error list index out of range for the final while sub-loop, and I can't work out why. The while loop is accounting for the new list length (while i < len(my_list) + 1). What am I missing?










share|improve this question





























    1















    I'm essentially trying to re-create a version of the insert() function for a homework assignment.
    I've written the following function:



    def insert_value(my_list, value, insert_position):
    list_copy =

    if insert_position < 0:
    insert_position = 0

    if insert_position >= len(my_list):
    insert_position = len(my_list) - 1

    i = 0
    while i < len(my_list) + 1:
    while i < insert_position:
    list_copy.append(my_list[i])
    i += 1

    while i == insert_position:
    list_copy.append(value)
    i += 1

    while i > insert_position:
    list_copy.append(my_list[i-1])
    i += 1

    return list_copy


    I get the error list index out of range for the final while sub-loop, and I can't work out why. The while loop is accounting for the new list length (while i < len(my_list) + 1). What am I missing?










    share|improve this question



























      1












      1








      1








      I'm essentially trying to re-create a version of the insert() function for a homework assignment.
      I've written the following function:



      def insert_value(my_list, value, insert_position):
      list_copy =

      if insert_position < 0:
      insert_position = 0

      if insert_position >= len(my_list):
      insert_position = len(my_list) - 1

      i = 0
      while i < len(my_list) + 1:
      while i < insert_position:
      list_copy.append(my_list[i])
      i += 1

      while i == insert_position:
      list_copy.append(value)
      i += 1

      while i > insert_position:
      list_copy.append(my_list[i-1])
      i += 1

      return list_copy


      I get the error list index out of range for the final while sub-loop, and I can't work out why. The while loop is accounting for the new list length (while i < len(my_list) + 1). What am I missing?










      share|improve this question
















      I'm essentially trying to re-create a version of the insert() function for a homework assignment.
      I've written the following function:



      def insert_value(my_list, value, insert_position):
      list_copy =

      if insert_position < 0:
      insert_position = 0

      if insert_position >= len(my_list):
      insert_position = len(my_list) - 1

      i = 0
      while i < len(my_list) + 1:
      while i < insert_position:
      list_copy.append(my_list[i])
      i += 1

      while i == insert_position:
      list_copy.append(value)
      i += 1

      while i > insert_position:
      list_copy.append(my_list[i-1])
      i += 1

      return list_copy


      I get the error list index out of range for the final while sub-loop, and I can't work out why. The while loop is accounting for the new list length (while i < len(my_list) + 1). What am I missing?







      python list insert






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Nov 18 '18 at 3:24









      sjakobi

      2,3061432




      2,3061432










      asked Nov 18 '18 at 2:14









      SoundscapeSoundscape

      379




      379
























          1 Answer
          1






          active

          oldest

          votes


















          3














          Your problem is because you are using those nested while loops which do not exit until their condition is false. So the outer while loop check for i being less then the length of my_list doesn't happen until all nested while loops finish (which it never does). Specifically I think the issue is with the last while loop here:



          while i > insert_position:
          list_copy.append(my_list[i-1])
          i += 1


          This while loop will not end because i will always be greater then the insert_position and eventually the i value will be outside the length of your my_list.





          If you change your code logic to use if statements inside the while loop I think that will be better and then you only have to increase i once at the end:



          i = 0
          while i < len(my_list) + 1:
          if i < insert_position:
          list_copy.append(my_list[i])
          elif i == insert_position:
          list_copy.append(value)
          else:
          list_copy.append(my_list[i-1])

          i += 1





          share|improve this answer


























          • Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

            – Soundscape
            Nov 18 '18 at 2:35











          • That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

            – Karl
            Nov 18 '18 at 2:41













          Your Answer






          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "1"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53357314%2frewrite-insert-function-list-index-out-of-range%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          3














          Your problem is because you are using those nested while loops which do not exit until their condition is false. So the outer while loop check for i being less then the length of my_list doesn't happen until all nested while loops finish (which it never does). Specifically I think the issue is with the last while loop here:



          while i > insert_position:
          list_copy.append(my_list[i-1])
          i += 1


          This while loop will not end because i will always be greater then the insert_position and eventually the i value will be outside the length of your my_list.





          If you change your code logic to use if statements inside the while loop I think that will be better and then you only have to increase i once at the end:



          i = 0
          while i < len(my_list) + 1:
          if i < insert_position:
          list_copy.append(my_list[i])
          elif i == insert_position:
          list_copy.append(value)
          else:
          list_copy.append(my_list[i-1])

          i += 1





          share|improve this answer


























          • Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

            – Soundscape
            Nov 18 '18 at 2:35











          • That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

            – Karl
            Nov 18 '18 at 2:41


















          3














          Your problem is because you are using those nested while loops which do not exit until their condition is false. So the outer while loop check for i being less then the length of my_list doesn't happen until all nested while loops finish (which it never does). Specifically I think the issue is with the last while loop here:



          while i > insert_position:
          list_copy.append(my_list[i-1])
          i += 1


          This while loop will not end because i will always be greater then the insert_position and eventually the i value will be outside the length of your my_list.





          If you change your code logic to use if statements inside the while loop I think that will be better and then you only have to increase i once at the end:



          i = 0
          while i < len(my_list) + 1:
          if i < insert_position:
          list_copy.append(my_list[i])
          elif i == insert_position:
          list_copy.append(value)
          else:
          list_copy.append(my_list[i-1])

          i += 1





          share|improve this answer


























          • Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

            – Soundscape
            Nov 18 '18 at 2:35











          • That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

            – Karl
            Nov 18 '18 at 2:41
















          3












          3








          3







          Your problem is because you are using those nested while loops which do not exit until their condition is false. So the outer while loop check for i being less then the length of my_list doesn't happen until all nested while loops finish (which it never does). Specifically I think the issue is with the last while loop here:



          while i > insert_position:
          list_copy.append(my_list[i-1])
          i += 1


          This while loop will not end because i will always be greater then the insert_position and eventually the i value will be outside the length of your my_list.





          If you change your code logic to use if statements inside the while loop I think that will be better and then you only have to increase i once at the end:



          i = 0
          while i < len(my_list) + 1:
          if i < insert_position:
          list_copy.append(my_list[i])
          elif i == insert_position:
          list_copy.append(value)
          else:
          list_copy.append(my_list[i-1])

          i += 1





          share|improve this answer















          Your problem is because you are using those nested while loops which do not exit until their condition is false. So the outer while loop check for i being less then the length of my_list doesn't happen until all nested while loops finish (which it never does). Specifically I think the issue is with the last while loop here:



          while i > insert_position:
          list_copy.append(my_list[i-1])
          i += 1


          This while loop will not end because i will always be greater then the insert_position and eventually the i value will be outside the length of your my_list.





          If you change your code logic to use if statements inside the while loop I think that will be better and then you only have to increase i once at the end:



          i = 0
          while i < len(my_list) + 1:
          if i < insert_position:
          list_copy.append(my_list[i])
          elif i == insert_position:
          list_copy.append(value)
          else:
          list_copy.append(my_list[i-1])

          i += 1






          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited Nov 18 '18 at 4:20

























          answered Nov 18 '18 at 2:23









          KarlKarl

          1,1432516




          1,1432516













          • Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

            – Soundscape
            Nov 18 '18 at 2:35











          • That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

            – Karl
            Nov 18 '18 at 2:41





















          • Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

            – Soundscape
            Nov 18 '18 at 2:35











          • That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

            – Karl
            Nov 18 '18 at 2:41



















          Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

          – Soundscape
          Nov 18 '18 at 2:35





          Marked as solution as it fixed the issue, but it has introduced (or revealed, more likely) a new problem. In the case where an item needs to be added to the end of the list, it adds it to the second last position instead. Why?

          – Soundscape
          Nov 18 '18 at 2:35













          That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

          – Karl
          Nov 18 '18 at 2:41







          That is because in your check to make sure that the insert position isn't greater then the list, you need to set insert_position = len(my_list) instead of len(my_list) - 1. It's wrong because it sets the insert_position to be the second to last position instead of the end of the list like you expect.

          – Karl
          Nov 18 '18 at 2:41




















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Stack Overflow!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53357314%2frewrite-insert-function-list-index-out-of-range%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Guess what letter conforming each word

          Port of Spain

          Run scheduled task as local user group (not BUILTIN)