Hello coders How can I store around 10^6 characters in a single string? Google is suggesting malloc or linked list Bt I don't know properly Can you please suggest any other way?

Just do the push function and instead of pushing numbers...., push characters, easy

Hello coders How can I store around 10^6 characters in a single string? Google is suggesting malloc or linked list Bt I don't know properly Can you please suggest any other way?

Sorry I couldn't understand Can you pls explain something more Or please provide any source related to this

struct Node {   char data;   struct Node *next; }; void push(struct Node** head_ref, char new_data) {     struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));     new_node->data  = new_data;     new_node->next = (*head_ref);     (*head_ref)    = new_node; }

the size of 1000000 characters doesn't even reach 1MB, so single array of chars should be enough local variable on the stack should be still capable to handle it, by default stack size is limited at 8MB but, yeah, for this size you better use heap from malloc(). No need to invent a linked list for this anyway

because your vector indices will range in between [0,max-1] so when you do v.at[a[i]] a[i] can be max too, and in that case your index will be out of range

ohhh,,, now i get it. Brilliant observation

because your vector indices will range in between [0,max-1] so when you do v.at[a[i]] a[i] can be max too, and in that case your index will be out of range

I have an array of length n with integer values. I calculated maximum integer(mx) of that array. I declared and defined a vector of pairs. Vector is of length max and pair consist bool, int. vector<pair<bool,int>> v(mx,make_pair(false,0)); Now, when I am looping through the array upto array length n and printing values stored in vector as follows, for(int i=0;i<n;++i){ cout <<v.at(a[i]).first << " " << v.at(a[i]).second << endl; } it is showing me this error terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4) how the vector could be out of range if i am using element of array as indices of vector ?

Try using iterators, or show code

thanku , but anshul helped me for the answer already.

this is the question https://leetcode.com/problems/increasing-order-search-tree/ and this is how i have attempted it but idk why i am getting an error, someone please look at the code

If we have to insert value in vector STL we use push_back. But what is we have to take input from user ??

The value

guys, who can help me? i need best compiler for c++ on macbook, not visual studio, any other free app

hey guys,some help here pls.i want to i want to sort this list alphabetically and want songs with the title “Untitled” to always appear at the top

so sort them and then move untitled to the top?

what function? O.o

or you could do it the opposite way, move untitled to the top and then sort the rest

i don't think this is correct since you are hardcoding 0

vect[0]=temp[0]; <- hardcoded 0

what to modify with it ?

vect[0] is the first element of vect, always

I use llvm based clang++

shouldn't i assign vect[0] to vect[j-1] which has value untitled???

Is it free

shouldn't i assign vect[0] to vect[j-1] which has value untitled???

You can just make normal sorting function and then add a special case for untitled in the same way you did with the comparator above

And your normal sorting function is incorrect now, because you sort only the first element basically

clang, gcc and to an extent, MSVC(that comes with VS) are free. (clang and gcc are also open source)

If there any thing you could tell me I well be thankful

So first of all, you want to sort the items and want untitled items to be first? If yes, first you need to fix your sorting algoritm. Just forget about untitled, you can remove that part for now. I guess you tried to implement a bubble sort? https://www.geeksforgeeks.org/bubble-sort/ You can compare the code with the implementation or try to execute your loops in your head step-by-step to figure out what is broken in your sorting algoritm. But I would suggest to use a debugger for that (just google "how to use debugger in [name of your IDE]"), it allows to execute your app step-by-step and investigate the state. Once you make your sorting work, test it on different inputs. Once you checked that it works on different inputs, instead of "vect[j - 1] > vect[j]" you need to add a similar check with what we discussed the last time above with "untitled". If you have a proper sorting algoritm you need to modify only the condition to achieve the correct behavior.

int a=1,b=2,c=3,d; d = ++a || ++b && ++c; cout<<a<<" "<<b<<" "<<c<<" "<<d;

just tell me value of abcd?

“undefined behavior”

why can you explain

to answer this question