Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. Coding Challenge - Morris Sequence

Coding Challenge - Morris Sequence

Scheduled Pinned Locked Moved The Lounge
questioncsharpcomdebuggingtutorial
98 Posts 15 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • K Kenneth Haugland

    Oh, the integer sequence are difined for a bit larger range than Dave gave here: A006751 - OEIS[^]

    D Offline
    D Offline
    Dave Kreskowiak
    wrote on last edited by
    #19

    That's cheating! :-D Oh, and what you linked to starts the sequence with a 2, not a 1.

    System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
    Dave Kreskowiak

    K 2 Replies Last reply
    0
    • D Dave Kreskowiak

      It's also known as the Conway Sequence, Look and Say Sequence, and probably some others. It's rather simple. Start with a 1 and then describe what you see for the next iteration. So, starting at 1, the next number is one 1 (11), the next is two 1 (21), then one 2 one 1 (1211), and so on:

      1
      11
      21
      1211
      111221
      312211

      The question to answer is what's the length in digits of the 100th number in the chain, starting with "1" as the first? The first six numbers have been given above. You could write it out by hand, but I wouldn't recommend it, and as developers, that's not what we do. The seemingly simple challenge is to write the code to come up with the answer. The only hint you get is the 50th number is 894,810 digits long. Oh, and don't bother Googling for code. Those examples will only get you so far and definitely won't get you to the answer.

      System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
      Dave Kreskowiak

      P Offline
      P Offline
      PIEBALDconsult
      wrote on last edited by
      #20

      Strings? Why not use a List of Tuple ? :) After more thought and before reading Richard's response... Tuple Using a byte to implement such a Tuple. Having read Richard's response... Huh, yeah, use a byte to implement a Tuple,Tuple>... :D I would also try to use many threads.

      1 Reply Last reply
      0
      • D Dave Kreskowiak

        That's cheating! :-D Oh, and what you linked to starts the sequence with a 2, not a 1.

        System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
        Dave Kreskowiak

        K Offline
        K Offline
        Kenneth Haugland
        wrote on last edited by
        #21

        I have been running the code (which I posted here somewhere) in the background as I'm reading for the exam. The text file that just holds the current number is 1.6 GB, and I guess that's one way of measuring the length. So I'll definitely post the end number on the Lounge forum :d Then it will at last contain something worthwhile :laugh:

        1 Reply Last reply
        0
        • D Dave Kreskowiak

          It's also known as the Conway Sequence, Look and Say Sequence, and probably some others. It's rather simple. Start with a 1 and then describe what you see for the next iteration. So, starting at 1, the next number is one 1 (11), the next is two 1 (21), then one 2 one 1 (1211), and so on:

          1
          11
          21
          1211
          111221
          312211

          The question to answer is what's the length in digits of the 100th number in the chain, starting with "1" as the first? The first six numbers have been given above. You could write it out by hand, but I wouldn't recommend it, and as developers, that's not what we do. The seemingly simple challenge is to write the code to come up with the answer. The only hint you get is the 50th number is 894,810 digits long. Oh, and don't bother Googling for code. Those examples will only get you so far and definitely won't get you to the answer.

          System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
          Dave Kreskowiak

          Richard DeemingR Offline
          Richard DeemingR Offline
          Richard Deeming
          wrote on last edited by
          #22

          This one's a real bugger for memory. String-based approaches are obviously out - 16 bits to store each character is overkill when the only symbols you need to store are 1, 2 and 3. List<byte> is obviously not going to work, because it would need to allocate an array big enough to hold the entire sequence. LinkedList<byte> has to create an object for every byte in the list, so the overhead far outweighs the payload. I settled on a custom singly-linked list of byte arrays, re-using two instances (previous and current) to reduce memory churn. But even that was eating huge amounts of memory. Finally, realising that the only numbers in the sequence are 1, 2 and 3, I decided to stuff four numbers into each byte, which brings the memory usage under control. However, it still takes a damn long time to run, and I haven't left it for long enough to get to the 100th iteration yet. Morris Sequence · GitHub[^] Having spent far too long thinking about this, now's the time for you to tell me there's some secret trick to calculate the sequence without having to store the whole thing. :-D


          "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

          "These people looked deep within my soul and assigned me a number based on the order in which I joined" - Homer

          G K 3 Replies Last reply
          0
          • D Dave Kreskowiak

            That's cheating! :-D Oh, and what you linked to starts the sequence with a 2, not a 1.

            System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
            Dave Kreskowiak

            K Offline
            K Offline
            Kenneth Haugland
            wrote on last edited by
            #23

            PS. Do you want the text file? ... ... ... :laugh: :laugh: :laugh:

            D 1 Reply Last reply
            0
            • Richard DeemingR Richard Deeming

              This one's a real bugger for memory. String-based approaches are obviously out - 16 bits to store each character is overkill when the only symbols you need to store are 1, 2 and 3. List<byte> is obviously not going to work, because it would need to allocate an array big enough to hold the entire sequence. LinkedList<byte> has to create an object for every byte in the list, so the overhead far outweighs the payload. I settled on a custom singly-linked list of byte arrays, re-using two instances (previous and current) to reduce memory churn. But even that was eating huge amounts of memory. Finally, realising that the only numbers in the sequence are 1, 2 and 3, I decided to stuff four numbers into each byte, which brings the memory usage under control. However, it still takes a damn long time to run, and I haven't left it for long enough to get to the 100th iteration yet. Morris Sequence · GitHub[^] Having spent far too long thinking about this, now's the time for you to tell me there's some secret trick to calculate the sequence without having to store the whole thing. :-D


              "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

              G Offline
              G Offline
              GuyThiebaut
              wrote on last edited by
              #24

              Here we go - breaking the no code in the lounge rule here...

              internal void Stream(int upTo)
              {

                  using (StreamWriter writer = new StreamWriter("E:\\\\temp\\\\MorrisSequence\\\\" + "line1.txt"))
                  {
                      writer.Write("1");
                  }
              
                  for (int i = 1; i <= upTo; i++)
                  {
                      Console.WriteLine(i);
              
                      using (StreamReader reader = new StreamReader("E:\\\\temp\\\\MorrisSequence\\\\" + "line" + i + ".txt"))
                      {
                          int count = 1;
                          char currChar = (char)reader.Read();
                          char lastChar = currChar;
                          char nextChar;
                          string writeNum = (i + 1).ToString();
              
                          using (StreamWriter writer = new StreamWriter("E:\\\\temp\\\\MorrisSequence\\\\" + "line" + writeNum + ".txt"))
                          {
                              while (reader.Peek() >= 0)
                              {
                                  nextChar = (char)reader.Peek();
                                  if (nextChar != lastChar)
                                  {
                                      writer.Write(count.ToString() + currChar.ToString());
                                      count = 0;
                                  }
                                  currChar= (char)reader.Read();
                                  lastChar = currChar;
                                  count++;
                              }
                              writer.Write(count.ToString() + currChar.ToString());
                          }
                      }
                  }
              }
              

              [edit] small tidy up, giving filenames proper names that relate to what they contain.

              “That which can be asserted without evidence, can be dismissed without evidence.”

              ― Christopher Hitchens

              Richard DeemingR 1 Reply Last reply
              0
              • D Dave Kreskowiak

                It's also known as the Conway Sequence, Look and Say Sequence, and probably some others. It's rather simple. Start with a 1 and then describe what you see for the next iteration. So, starting at 1, the next number is one 1 (11), the next is two 1 (21), then one 2 one 1 (1211), and so on:

                1
                11
                21
                1211
                111221
                312211

                The question to answer is what's the length in digits of the 100th number in the chain, starting with "1" as the first? The first six numbers have been given above. You could write it out by hand, but I wouldn't recommend it, and as developers, that's not what we do. The seemingly simple challenge is to write the code to come up with the answer. The only hint you get is the 50th number is 894,810 digits long. Oh, and don't bother Googling for code. Those examples will only get you so far and definitely won't get you to the answer.

                System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                Dave Kreskowiak

                K Offline
                K Offline
                Kirk 10389821
                wrote on last edited by
                #25

                I used a new AI program I trained on twitter... It responded: 1 Really large string of numbers NOBODY cares about, just like you. Delete yourself. I added "Plz" and it simply said "Go away Troll" I am having second thoughts about it having access to: - NEST devices (including garage door, locking all doors) - Internet access to unlock and start my car - IP Phone / Router... So I can't call for hel...

                1 Reply Last reply
                0
                • G GuyThiebaut

                  Here we go - breaking the no code in the lounge rule here...

                  internal void Stream(int upTo)
                  {

                      using (StreamWriter writer = new StreamWriter("E:\\\\temp\\\\MorrisSequence\\\\" + "line1.txt"))
                      {
                          writer.Write("1");
                      }
                  
                      for (int i = 1; i <= upTo; i++)
                      {
                          Console.WriteLine(i);
                  
                          using (StreamReader reader = new StreamReader("E:\\\\temp\\\\MorrisSequence\\\\" + "line" + i + ".txt"))
                          {
                              int count = 1;
                              char currChar = (char)reader.Read();
                              char lastChar = currChar;
                              char nextChar;
                              string writeNum = (i + 1).ToString();
                  
                              using (StreamWriter writer = new StreamWriter("E:\\\\temp\\\\MorrisSequence\\\\" + "line" + writeNum + ".txt"))
                              {
                                  while (reader.Peek() >= 0)
                                  {
                                      nextChar = (char)reader.Peek();
                                      if (nextChar != lastChar)
                                      {
                                          writer.Write(count.ToString() + currChar.ToString());
                                          count = 0;
                                      }
                                      currChar= (char)reader.Read();
                                      lastChar = currChar;
                                      count++;
                                  }
                                  writer.Write(count.ToString() + currChar.ToString());
                              }
                          }
                      }
                  }
                  

                  [edit] small tidy up, giving filenames proper names that relate to what they contain.

                  “That which can be asserted without evidence, can be dismissed without evidence.”

                  ― Christopher Hitchens

                  Richard DeemingR Offline
                  Richard DeemingR Offline
                  Richard Deeming
                  wrote on last edited by
                  #26

                  That's one way around it. But I hope you've got a large SSD! :-D Is there a reason you're writing strings instead of bytes?


                  "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

                  "These people looked deep within my soul and assigned me a number based on the order in which I joined" - Homer

                  G 1 Reply Last reply
                  0
                  • Richard DeemingR Richard Deeming

                    This one's a real bugger for memory. String-based approaches are obviously out - 16 bits to store each character is overkill when the only symbols you need to store are 1, 2 and 3. List<byte> is obviously not going to work, because it would need to allocate an array big enough to hold the entire sequence. LinkedList<byte> has to create an object for every byte in the list, so the overhead far outweighs the payload. I settled on a custom singly-linked list of byte arrays, re-using two instances (previous and current) to reduce memory churn. But even that was eating huge amounts of memory. Finally, realising that the only numbers in the sequence are 1, 2 and 3, I decided to stuff four numbers into each byte, which brings the memory usage under control. However, it still takes a damn long time to run, and I haven't left it for long enough to get to the 100th iteration yet. Morris Sequence · GitHub[^] Having spent far too long thinking about this, now's the time for you to tell me there's some secret trick to calculate the sequence without having to store the whole thing. :-D


                    "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

                    K Offline
                    K Offline
                    Kenneth Haugland
                    wrote on last edited by
                    #27

                    Doesn't look like there is a know shortcut: Look-and-say sequence - Rosetta Code[^] But they do post a formula here: A005150 - OEIS[^] But it looks complicated. I used chars, and the txt file is 2 GB now :S

                    1 Reply Last reply
                    0
                    • Richard DeemingR Richard Deeming

                      That's one way around it. But I hope you've got a large SSD! :-D Is there a reason you're writing strings instead of bytes?


                      "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

                      G Offline
                      G Offline
                      GuyThiebaut
                      wrote on last edited by
                      #28

                      I was tempted to leave it running this evening but as you mention I think it will fill up the disk space - file 77 is just over 1 gig in size and it's only a text file. What I may do is compress then delete files prior to the one I am currently reading(the 1 gig file compresses to 80mb largely because it is composed of 1s,2s and 3s).

                      Richard Deeming wrote:

                      Is there a reason you're writing strings instead of bytes?

                      Um er yes, um err, um er because... that idea never occurred to me - thanks for the tip :thumbsup:

                      “That which can be asserted without evidence, can be dismissed without evidence.”

                      ― Christopher Hitchens

                      K 1 Reply Last reply
                      0
                      • G GuyThiebaut

                        I was tempted to leave it running this evening but as you mention I think it will fill up the disk space - file 77 is just over 1 gig in size and it's only a text file. What I may do is compress then delete files prior to the one I am currently reading(the 1 gig file compresses to 80mb largely because it is composed of 1s,2s and 3s).

                        Richard Deeming wrote:

                        Is there a reason you're writing strings instead of bytes?

                        Um er yes, um err, um er because... that idea never occurred to me - thanks for the tip :thumbsup:

                        “That which can be asserted without evidence, can be dismissed without evidence.”

                        ― Christopher Hitchens

                        K Offline
                        K Offline
                        Kenneth Haugland
                        wrote on last edited by
                        #29

                        I have already text files over 2.2 GB so I think you'll have to delete them as you gom at least that's what I do. And I think using bytes is cheating :laugh: also I didn't know that 3 would be the highest number. I don't think is enough not if you start at 3,4,5 or any other number, at least I got some 5 then. Or my code was wrong.

                        G Richard DeemingR 2 Replies Last reply
                        0
                        • K Kenneth Haugland

                          I have already text files over 2.2 GB so I think you'll have to delete them as you gom at least that's what I do. And I think using bytes is cheating :laugh: also I didn't know that 3 would be the highest number. I don't think is enough not if you start at 3,4,5 or any other number, at least I got some 5 then. Or my code was wrong.

                          G Offline
                          G Offline
                          GuyThiebaut
                          wrote on last edited by
                          #30

                          My comment about 1,2,3 was based on looking at file 50 very briefly. I could run an analysis as I go through them. I have re-written it so that it zips and deletes files that are not being read - let's see how quickly my computer or hard drive goes up in a puff of smoke... My guess is that it may be one of those tasks where it is not possible to calculate up to 100 within the lifetime of the universe.

                          “That which can be asserted without evidence, can be dismissed without evidence.”

                          ― Christopher Hitchens

                          K D 2 Replies Last reply
                          0
                          • G GuyThiebaut

                            My comment about 1,2,3 was based on looking at file 50 very briefly. I could run an analysis as I go through them. I have re-written it so that it zips and deletes files that are not being read - let's see how quickly my computer or hard drive goes up in a puff of smoke... My guess is that it may be one of those tasks where it is not possible to calculate up to 100 within the lifetime of the universe.

                            “That which can be asserted without evidence, can be dismissed without evidence.”

                            ― Christopher Hitchens

                            K Offline
                            K Offline
                            Kenneth Haugland
                            wrote on last edited by
                            #31

                            GuyThiebaut wrote:

                            My guess is that it may be one of those tasks where it is not possible to calculate up to 100 within the lifetime of the universe.

                            Nah, I don't think so, I was able to run up to 77 before VS threw an out of memory exception. And as I told Richard, I think I found a formula, but It looked kind of complicated.

                            1 Reply Last reply
                            0
                            • Richard DeemingR Richard Deeming

                              This one's a real bugger for memory. String-based approaches are obviously out - 16 bits to store each character is overkill when the only symbols you need to store are 1, 2 and 3. List<byte> is obviously not going to work, because it would need to allocate an array big enough to hold the entire sequence. LinkedList<byte> has to create an object for every byte in the list, so the overhead far outweighs the payload. I settled on a custom singly-linked list of byte arrays, re-using two instances (previous and current) to reduce memory churn. But even that was eating huge amounts of memory. Finally, realising that the only numbers in the sequence are 1, 2 and 3, I decided to stuff four numbers into each byte, which brings the memory usage under control. However, it still takes a damn long time to run, and I haven't left it for long enough to get to the 100th iteration yet. Morris Sequence · GitHub[^] Having spent far too long thinking about this, now's the time for you to tell me there's some secret trick to calculate the sequence without having to store the whole thing. :-D


                              "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

                              K Offline
                              K Offline
                              Kenneth Haugland
                              wrote on last edited by
                              #32

                              Well, he did only ask about the length of the 100 th number. So according to Look-and-say sequence - Wikipedia[^]. Dave told us that the 50th number had length:

                              L50 = 894810

                              And the wikipedia article said:

                              L_n+1/L_n= lambda = 1.303577269034

                              so....

                              L50*lambda^(50)= 511175198256

                              if my math is right enough. Very hard programming challange :D

                              D A 2 Replies Last reply
                              0
                              • G GuyThiebaut

                                My comment about 1,2,3 was based on looking at file 50 very briefly. I could run an analysis as I go through them. I have re-written it so that it zips and deletes files that are not being read - let's see how quickly my computer or hard drive goes up in a puff of smoke... My guess is that it may be one of those tasks where it is not possible to calculate up to 100 within the lifetime of the universe.

                                “That which can be asserted without evidence, can be dismissed without evidence.”

                                ― Christopher Hitchens

                                D Offline
                                D Offline
                                Dave Kreskowiak
                                wrote on last edited by
                                #33

                                Oh, it's possible. My machine is sitting here listing the iteration, length, and time to calculate for each of the 100 numbers.

                                System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                Dave Kreskowiak

                                G K 2 Replies Last reply
                                0
                                • K Kenneth Haugland

                                  Well, he did only ask about the length of the 100 th number. So according to Look-and-say sequence - Wikipedia[^]. Dave told us that the 50th number had length:

                                  L50 = 894810

                                  And the wikipedia article said:

                                  L_n+1/L_n= lambda = 1.303577269034

                                  so....

                                  L50*lambda^(50)= 511175198256

                                  if my math is right enough. Very hard programming challange :D

                                  D Offline
                                  D Offline
                                  Dave Kreskowiak
                                  wrote on last edited by
                                  #34

                                  Exact length is required and that's not the answer.

                                  System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                  Dave Kreskowiak

                                  K 1 Reply Last reply
                                  0
                                  • K Kenneth Haugland

                                    PS. Do you want the text file? ... ... ... :laugh: :laugh: :laugh:

                                    D Offline
                                    D Offline
                                    Dave Kreskowiak
                                    wrote on last edited by
                                    #35

                                    Good luck posting it! :laugh:

                                    System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                    Dave Kreskowiak

                                    1 Reply Last reply
                                    0
                                    • D Dave Kreskowiak

                                      Oh, it's possible. My machine is sitting here listing the iteration, length, and time to calculate for each of the 100 numbers.

                                      System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                      Dave Kreskowiak

                                      G Offline
                                      G Offline
                                      GuyThiebaut
                                      wrote on last edited by
                                      #36

                                      Good to know! Currently at line 82 and the file size for line 82 alone is over 4 Gigabytes.

                                      “That which can be asserted without evidence, can be dismissed without evidence.”

                                      ― Christopher Hitchens

                                      D 1 Reply Last reply
                                      0
                                      • G GuyThiebaut

                                        Good to know! Currently at line 82 and the file size for line 82 alone is over 4 Gigabytes.

                                        “That which can be asserted without evidence, can be dismissed without evidence.”

                                        ― Christopher Hitchens

                                        D Offline
                                        D Offline
                                        Dave Kreskowiak
                                        wrote on last edited by
                                        #37

                                        4,326,816,254 to be exact.

                                        System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                        Dave Kreskowiak

                                        G 1 Reply Last reply
                                        0
                                        • D Dave Kreskowiak

                                          Exact length is required and that's not the answer.

                                          System.ItDidntWorkException: Something didn't work as expected. C# - How to debug code[^]. Seriously, go read these articles.
                                          Dave Kreskowiak

                                          K Offline
                                          K Offline
                                          Kenneth Haugland
                                          wrote on last edited by
                                          #38

                                          Cant be far off :)

                                          D 1 Reply Last reply
                                          0
                                          Reply
                                          • Reply as topic
                                          Log in to reply
                                          • Oldest to Newest
                                          • Newest to Oldest
                                          • Most Votes


                                          • Login

                                          • Don't have an account? Register

                                          • Login or register to search.
                                          • First post
                                            Last post
                                          0
                                          • Categories
                                          • Recent
                                          • Tags
                                          • Popular
                                          • World
                                          • Users
                                          • Groups