int arr1[N];
int arr2[N];
If we are using arr1 and arr2 in the program what will be the overall space complexity of the program O(n^2) or O(n)?
Asked
Active
Viewed 497 times
2
Nakul Amate
- 21
- 2
-
1By `O(n2)`, do you mean `O(n*2)` or `O(n^2)`? – Ken Wayne VanderLinde Jun 17 '21 at 06:46
-
1Space complexity means how much extra memory your algorithm takes to solve a problem. If there it declares 2 one dimensional arrays of size in then its size complexity will be O(2n). – foragerDev Jun 17 '21 at 07:03
-
1Two things of size N take up the same space as one thing of size 2*N. – molbdnilo Jun 17 '21 at 07:32
-
1possible duplicates of https://stackoverflow.com/questions/22188851/why-is-the-constant-always-dropped-from-big-o-analysis spoiler alert it is O(n) – Alessandro Teruzzi Jun 17 '21 at 08:10
-
nitpick: space complexity is about how memory consumption varies with increasing `N`, though in your example `N` is a compile time constant. Hence, it is questionable to talk about space complexity of the compiled program. Once complied the space complexity is a constant – 463035818_is_not_an_ai Jun 17 '21 at 08:43
-
@KenWayneVanderLinde by O(n2) I mean O(n^2) – Nakul Amate Jun 17 '21 at 09:02
-
@NakulAmate Please add the code snippet in which you are trying to use this Arrays – Savan Gadhiya Jun 17 '21 at 10:45