All Questions

I made a program to remove duplicate elements in an array, but it is not working correctly. Can someone help me with it? When I input 1,1,1,2,3 it displays 1,1,2,3. It works fine with other inputs, ...

For a sequence of numbers a1, a2,...,an, we say that there is a period if 1≤p<n and if it holds that it is ai=ai+p for all values for which this equality makes sense. For example, the sequence of ...

I'm having trouble figuring out the time equation for a couple small snippets of code. int sum = 0; for (int k = n; k > 0; k /= 2) for (int i = 0; i < k; i++) sum++; int sum = 0; ...

Can anybody please tell me what is wrong with this code. Whenever I try to run this I end up with an invalid syntax error. I'm a beginner, I'd be grateful if you can guide me Thank you in advance! ...

I want to devise a program to input a positive integer, and by using XX characters – output a figure that has n rows and each row k has k pairs of XX. For instance, if input is 5, the output will be: ...

I'm trying to find a better/faster algorithm that doesn't timeout when I try to find any 2 numbers in an array of numbers that add up to a sum(ex. s). I need to return the pair of numbers that adds ...

I am trying to come up with the following output: Row 1 Col A Row 1 Col B Row 2 Col A Row 2 Col B I am having trouble figuring out the logic to complete this task. So far I came up with the code ...

I had to do a problem which required me to figure out the runtime for this snippet of code: for (i = 1; i <= log(n); i = i + 1) { for (j = 1; j <= 2*i; j = 2*j) { for (k = 1; k <=...

What is the worst and the best time complexity for nested for loop? int compare(int n, int A[][]) { int i, j, k, m; for (i=1; i<=n; i++) { for (j=1; j<=n; j++) { for ...

for my assignment I need to loop through list of words (5757 total) and compare all words with easy other. The words are sorted and I make an array with them all, that's not important, checking words ...

Sorry for the terrible title, but I have no clue on how to generalize (or simplify) my loop case here. I have a program that iterates to a sequence of integer, for example dimension=1 to 5. In each ...

I need to give the running times for the following for loops (in big-Oh notation): sum = 0 for i = 1 to n do for j = 1 to i do sum++ sum = 0 for i = 1 to n do for j = 1 to i^3 do ...

I am aware of the various rates of Big O such as O(n^2) and O(n), and have no problem determining the Big O value of simple nested for loops such as the following. for (int i = 0; i < n; i++) ...

Is there a way to create for-loops of a form for(int i = 0; i < 9; ++i) { for(int j = 0; j < 9; ++i) { //... for(int k = 0; k < 9; ++k) { //N-th loop without knowing N at the ...