{"id":76029,"date":"2024-05-12T12:37:59","date_gmt":"2024-05-12T16:37:59","guid":{"rendered":"https:\/\/bangla.sitestree.com\/?p=76029"},"modified":"2024-05-12T12:37:59","modified_gmt":"2024-05-12T16:37:59","slug":"algorithm-complexity-a-simple-example","status":"publish","type":"post","link":"http:\/\/bangla.sitestree.com\/?p=76029","title":{"rendered":"Algorithm Complexity: A simple example"},"content":{"rendered":"

The complexity here is: 3n+2 i.e. O(n)<\/p>\n

\"\"<\/a><\/p>\n

Ref: https:\/\/www2.cs.sfu.ca\/CourseCentral\/125\/johnwill\/Packet06.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

The complexity here is: 3n+2 i.e. O(n) Ref: https:\/\/www2.cs.sfu.ca\/CourseCentral\/125\/johnwill\/Packet06.pdf<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[182],"tags":[],"class_list":["post-76029","post","type-post","status-publish","format-standard","hentry","category---blog","item-wrap"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[{"id":76032,"url":"http:\/\/bangla.sitestree.com\/?p=76032","url_meta":{"origin":76029,"position":0},"title":"Algorithm Complexity: Notations and Comparisons","author":"Sayed","date":"May 12, 2024","format":false,"excerpt":"Algorithm Complexity Notations and Comparisons: Ref: https:\/\/www.freecodecamp.org\/news\/big-o-notation-why-it-matters-and-why-it-doesnt-1674cfa8a23c\/","rel":"","context":"In "\u09ac\u09cd\u09b2\u0997 \u0964 Blog"","block_context":{"text":"\u09ac\u09cd\u09b2\u0997 \u0964 Blog","link":"http:\/\/bangla.sitestree.com\/?cat=182"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/05\/image-15.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/05\/image-15.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/05\/image-15.png?resize=525%2C300 1.5x, https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2024\/05\/image-15.png?resize=700%2C400 2x"},"classes":[]},{"id":13767,"url":"http:\/\/bangla.sitestree.com\/?p=13767","url_meta":{"origin":76029,"position":1},"title":"CS101 – Discrete Mathematics – Quadratic Time Complexity","author":"Author-Check- Article-or-Video","date":"November 1, 2017","format":false,"excerpt":"Discrete Mathematics Week 03 Lecture 04 - Quadratic Time Complexity https:\/\/discrete-math.appspot.com\/ \u09ac\u09bf\u099a\u09cd\u099b\u09bf\u09a8\u09cd\u09a8 \u0997\u09a3\u09bf\u09a4 \u09a4\u09c3\u09a4\u09c0\u09df \u09b8\u09aa\u09cd\u09a4\u09be\u09b9 \u09b2\u09c7\u0995\u099a\u09be\u09b0 \u09e6\u09ea - \u0995\u09cb\u09df\u09be\u09a1\u09cd\u09b0\u09c7\u099f\u09bf\u0995 \u099f\u09be\u0987\u09ae \u0995\u09ae\u09aa\u09cd\u09b2\u09c7\u0995\u09cd\u09b8\u09bf\u099f\u09bf Click Here to Order your copy of the DVD: http:\/\/bit.ly\/DiscreteMathDVD","rel":"","context":"In "Misc Computing"","block_context":{"text":"Misc Computing","link":"http:\/\/bangla.sitestree.com\/?cat=1884"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2017\/11\/hqdefault-24.jpg?fit=480%2C360&resize=350%2C200","width":350,"height":200},"classes":[]},{"id":71256,"url":"http:\/\/bangla.sitestree.com\/?p=71256","url_meta":{"origin":76029,"position":2},"title":"If you solve Toeplitz systems using Gaussian Eliminations, what is the algorithmic complexity (algorithm)?","author":"Sayed","date":"September 27, 2021","format":false,"excerpt":"If you can, answer the question below: Write your answer in the comment box. If you solve Toeplitz systems using Gaussian Eliminations, what is the algorithmic complexity (algorithm)?","rel":"","context":"In "Matrix and Signal Processing"","block_context":{"text":"Matrix and Signal Processing","link":"http:\/\/bangla.sitestree.com\/?cat=1944"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":13765,"url":"http:\/\/bangla.sitestree.com\/?p=13765","url_meta":{"origin":76029,"position":3},"title":"CS101 – Discrete Mathematics – Time Complexity of Binary Search","author":"Author-Check- Article-or-Video","date":"November 1, 2017","format":false,"excerpt":"Discrete Mathematics Week 03 Lecture 03 - Time Complexity of Binary Search https:\/\/discrete-math.appspot.com\/ \u09ac\u09bf\u099a\u09cd\u099b\u09bf\u09a8\u09cd\u09a8 \u0997\u09a3\u09bf\u09a4 \u09a4\u09c3\u09a4\u09c0\u09df \u09b8\u09aa\u09cd\u09a4\u09be\u09b9 \u09b2\u09c7\u0995\u099a\u09be\u09b0 \u09e6\u09e9 - \u09ac\u09be\u0987\u09a8\u09be\u09b0\u09bf \u09b8\u09be\u09b0\u09cd\u099a\u09c7\u09b0 \u099f\u09be\u0987\u09ae \u0995\u09ae\u09aa\u09cd\u09b2\u09c7\u0995\u09cd\u09b8\u09bf\u099f\u09bf Click Here to Order your copy of the DVD: http:\/\/bit.ly\/DiscreteMathDVD","rel":"","context":"In "Misc Computing"","block_context":{"text":"Misc Computing","link":"http:\/\/bangla.sitestree.com\/?cat=1884"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/bangla.sitestree.com\/wp-content\/uploads\/2017\/11\/hqdefault-23.jpg?fit=480%2C360&resize=350%2C200","width":350,"height":200},"classes":[]},{"id":71073,"url":"http:\/\/bangla.sitestree.com\/?p=71073","url_meta":{"origin":76029,"position":4},"title":"How is the computational complexity of k-nearest neighbor and k-means clustering? Are they do once and use always solution?","author":"Sayed","date":"September 20, 2021","format":false,"excerpt":"If you can, answer the question below: Write your answer in the comment box. How is the computational complexity of k-nearest neighbor and k-means clustering? Are they do once and use always solution?","rel":"","context":"In "Introduction to Machine Learning"","block_context":{"text":"Introduction to Machine Learning","link":"http:\/\/bangla.sitestree.com\/?cat=1945"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":71258,"url":"http:\/\/bangla.sitestree.com\/?p=71258","url_meta":{"origin":76029,"position":5},"title":"Can you utilize the structure of a Toeplitz matrix to find solutions that have lower algorithmic (flops, operation count) complexity?","author":"Sayed","date":"September 27, 2021","format":false,"excerpt":"If you can, answer the question below: Write your answer in the comment box. Can you utilize the structure of a Toeplitz matrix to find solutions that have lower algorithmic (flops, operation count) complexity?","rel":"","context":"In "Matrix and Signal Processing"","block_context":{"text":"Matrix and Signal Processing","link":"http:\/\/bangla.sitestree.com\/?cat=1944"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76029","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=76029"}],"version-history":[{"count":1,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76029\/revisions"}],"predecessor-version":[{"id":76031,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/76029\/revisions\/76031"}],"wp:attachment":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=76029"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=76029"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=76029"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}