Don't forget to block and report

Actually 😅 I have tried in this way Also but I don't know I made mistake in somewhere ..... In the code.... Segmentation fault error came That's why I left this logic .... And implemented as I have shared.... Btw thanks buddy....

int rotatearr(int arr[],int d,int n) { int index =0; int temp[d]; //Copying element into temp for(int i=0;i<d;i++) { temp[i]=arr[i]; } //Shifting element by d position so //every element get into proper place for(int j=0;j<n;j++) { arr[j]=arr[j+d]; } //rejoining element for(int k=n-d;k<n;k++) { arr[k]=temp[index]; index++; } return 0; }

everything is wrong. size of array arr may be greater, equal or less than parameter d

No it's going to be always less than The size of array And yeah D is the number upto which we have to rotate tha array right It may be 2,3,4,5etc

No it's going to be always less than The size of array And yeah D is the number upto which we have to rotate tha array right It may be 2,3,4,5etc

also, you have to add constraints for all array index accessors like arr[j+d] etc, to enshure that all j+d values are not goes over the bounds of the array, even by one element

Could he use mod operator to know where the i element must go?

I remember that, when i tried to rotate arrays

Yep

he is not rotating array, he goes far beyound and array boundaries with arr[j+d];

2017-12-15

2017-12-05T12:34:42.00000+00:02

Anyone who knows C proggraming to help me on something

/ban

. Write an algorithm on sheet to perform Bubble sort on minimum 7 element of string type as per your choice in descending order. After sorting the array also insert one new element as per your choice in the mid and make sure the array remain sorted. You also need to dry run the algorithm by explaining step by step for first three iteration of sorting and then the last about inserted element in the list .

. Write an algorithm on sheet to perform Bubble sort on minimum 7 element of string type as per your choice in descending order. After sorting the array also insert one new element as per your choice in the mid and make sure the array remain sorted. You also need to dry run the algorithm by explaining step by step for first three iteration of sorting and then the last about inserted element in the list .

/ban homework

/ban homework

What!? No way!

Ok, non-admin

Come to ot and talk to me lol

Our PMs is OT ( ͡° ͜ʖ ͡°)

I need someone who can make c program . Please PM me I will pay .

Can we install geeksforgeeks on Windows ????

https://mrcodehunter.com/what-is-cpp-used-for-real-world-applications/

OOP is not best part of C++

What is then?

Message

@tech_not_life

Hi everyone, I have an issue with my code. I want to create some object dynamically using new, I have a class called "Projectile", so I created a poiner Projectile* proj and initialize it to NULL. I can easily create and initialize the data for this pointer using proj = new Projectile in the main, but there are some instances where I need to delete the contents of this pointer during a call to a function called Projectile::move(Projectile** proj). In move(), when I check the condition for the deletion of the pointer, I use delete *proj, which sounds good at first because the pointer is initialized back to NULL. The issue comes when I try to create another Projectile on the same pointer *proj, the debugger (gdb on mingw windows) stops execution because of a breakpoint trap. I do not have any breakpoints so I my only guess is that the program has a memory leak related to the deletion (or creation, or both) of the *proj pointer. Is there a way to create and destroy objects properly without memory leaks? tl:dr how can I use new and delete on only one pointer?

What is then?

contracts

They are not part of C++ for now

hmmm. templates then

But maybe you will like concepts? :)

#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll loop = 1e18; ll ans = 0; ll a=0, b=0; for (ll i = -loop; i < loop; i++){ a += ans; b += a; ans = ans + 1; a -= ans-1; b-=a+ans-1; } cout << a << endl; } This works with turning on the optimisations(LOOP doesn't give Time limit exceeded). Huh ! Is that thing resolved during compile time? If so, how? And why in this case?

#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll loop = 1e18; ll ans = 0; ll a=0, b=0; for (ll i = -loop; i < loop; i++){ a += ans; b += a; ans = ans + 1; a -= ans-1; b-=a+ans-1; } cout << a << endl; } This works with turning on the optimisations(LOOP doesn't give Time limit exceeded). Huh ! Is that thing resolved during compile time? If so, how? And why in this case?