We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
O(n) in this case is only for the time complexity, it means linear. In the practice is a simple loop, so for example if you have a loop inside another loop the time complexity will be o(n2). This is theory from Big O Notacion.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Array Manipulation
You are viewing a single comment's thread. Return to all comments →
O(n) in this case is only for the time complexity, it means linear. In the practice is a simple loop, so for example if you have a loop inside another loop the time complexity will be o(n2). This is theory from Big O Notacion.