Time complexity and number of elements operated on











up vote
0
down vote

favorite












Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.



Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.



Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?






algorithm time-complexity big-o







share|improve this question




























    up vote
    0
    down vote

    favorite












    Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.



    Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.



    Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?






    algorithm time-complexity big-o







    share|improve this question


























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.



      Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.



      Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?






      algorithm time-complexity big-o







      share|improve this question















      Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.



      Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.



      Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?






      algorithm time-complexity big-o




      algorithm time-complexity big-o






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Nov 10 at 23:03









      Scott Hunter

      32.7k63970




      32.7k63970










      asked Nov 10 at 22:55









      erykkk

      466




      466
























          2 Answers
          2






          active

          oldest

          votes

















          up vote
          2
          down vote













          The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.






          share|improve this answer




























            up vote
            1
            down vote













            Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.






            share|improve this answer





















              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',
              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%2f53244224%2ftime-complexity-and-number-of-elements-operated-on%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes








              up vote
              2
              down vote













              The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.






              share|improve this answer

























                up vote
                2
                down vote













                The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.






                share|improve this answer























                  up vote
                  2
                  down vote










                  up vote
                  2
                  down vote









                  The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.






                  share|improve this answer












                  The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered Nov 10 at 23:03









                  Charlie

                  5442626




                  5442626
























                      up vote
                      1
                      down vote













                      Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.






                      share|improve this answer

























                        up vote
                        1
                        down vote













                        Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.






                        share|improve this answer























                          up vote
                          1
                          down vote










                          up vote
                          1
                          down vote









                          Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.






                          share|improve this answer












                          Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.







                          share|improve this answer












                          share|improve this answer



                          share|improve this answer










                          answered Nov 10 at 23:02









                          Scott Hunter

                          32.7k63970




                          32.7k63970






























                               

                              draft saved


                              draft discarded



















































                               


                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53244224%2ftime-complexity-and-number-of-elements-operated-on%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

                              Bressuire

                              Image
                              Subprefecture and commune in Nouvelle-Aquitaine, France Bressuire Subprefecture and commune Chateau de Bressuire and the Eglise Notre-Dame Coat of arms Location of Bressuire Bressuire Show map of France Bressuire Show map of Nouvelle-Aquitaine Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Country France Region Nouvelle-Aquitaine Department Deux-Sèvres Arrondissement Bressuire Canton Bressuire Government  • Mayor .mw-parser-output .nobold{font-weight:normal} (2014–20) Jean Michel Bernier Area 1 180.59 km 2 (69.73 sq mi) Population (2014) 2 19,300  • Density 110/km 2 (280/sq mi) Time zone UTC+01:00 (CET)  • Summer (DST) UTC+02:00 (CEST) INSEE/Postal code 79049 /79300 Elevation 98–236 m (322–774 ft) (avg. 173 m or 568 ft) 1 French Land Register data, which exclude...
                              Read more

                              Vorschmack

                              Image
                              Vorschmack Ukrainian Jewish-style vorschmack served on rye bread Course Hors d'oeuvre Region or state Eastern Europe Associated national cuisine Ashkenazi Jewish, Finnish, German, Ukrainian, Polish, Russian Main ingredients Ground meat and/or fish Cookbook: Vorschmack   Media: Vorschmack Vorschmack or forshmak (Yiddish: פֿאָרשמאַק ‎, from archaic German Vorschmack , "foretaste" [1] or "appetizer" [2] ) is an originally East European dish made of salty minced fish or meat. Different variants of this dish are especially common in Ashkenazi Jewish and Finnish cuisine. Some varieties are also known in Russian and Polish cuisine. Contents 1 In Jewish cuisine 2 In Russian cuisine 3 In Polish cuisine 4 In Finnish cuisine 5 See also 6 References In Jewish cuisine According to Gil Marks, the German name points to the possible Germanic origin of this dish. [1] William Pokhlyobkin descr...
                              Read more

                              Quarantine

                              Image
                              For other uses, see Quarantine (disambiguation). Signal flag "Lima" called the "Yellow Jack" which when flown in harbor means ship is under quarantine. A simple yellow flag (also called the "Yellow Jack") had historically been used to signal quarantine (it stands for Q among signal flags), but now indicates the opposite, as a signal of a ship free of disease that requests boarding and inspection. A quarantine is used to separate and restrict the movement of people; it is 'a restraint upon the activities or communication of persons or the transport of goods designed to prevent the spread of disease or pests', for a certain period of time. [1] This is often used in connection to disease and illness, such as those who may possibly have been exposed to a communicable disease. [2] The term is often erroneously used to mean medical isolation, which is "to separate ill persons who have a communicable disease from those who are healthy...
                              Read more