@programminginc - страница 1919

Anonymous

for C you have The C Programming LAnguage from Ritche and Kernighan

Anonymous

you have the books from Meyers and many more, but those books are for advanced or at least you will need some level

Vikky

for C you have The C Programming LAnguage from Ritche and Kernighan

Thanks

Azzam

I have a 2D array(vector<vector<>>) of size MxN, I want to create a new vector in which I want to add some of these vectors but unable to add these directly or without using loops.... is there any solution?? Thank you !

Anonymous

you will need some years too :D

Azzam

you will need some years too :D

So it's a no?

Anonymous

you could create one vector instead of a vector of vectors

Anonymous

I mean, you could create sth like: vector<> v;

Anonymous

v.resize(M*N);

Azzam

I mean, you could create sth like: vector<> v;

In this I want to add all the vectors stored in vector<vector<<>>

Anonymous

yes, for sure

Azzam

yes, for sure

How?

Anonymous

I told you

Azzam

🙋‍♂

Anonymous

instead of: vector<vector<>> v; -> vector<> v; v.resize(M*N);

Anonymous

so you can create a new vector and assign or whatever

Azzam

instead of: vector<vector<>> v; -> vector<> v; v.resize(M*N);

This will increase the length of my vector 🙄

Azzam

so you can create a new vector and assign or whatever

Okay thanks

Anonymous

This will increase the length of my vector 🙄

no, the length is the same

Anonymous

conceptually is the same

Azzam

no, the length is the same

Then?

Azzam

Wait... Let me research about it

Anonymous

yes, you need to research :D

Azzam

Any good resources for STL?

Anonymous

in C there is no difference between int a[30][30]; and int a[30*30];When I said: there is no difference, I meant that the memory is contiguous

Azzam

in C there is no difference between int a[30][30]; and int a[30*30];When I said: there is no difference, I meant that the memory is contiguous

I didn't know that

Anonymous

in C++ with vectores is somewhat different but conceptually, it's the same

Azzam

in C++ with vectores is somewhat different but conceptually, it's the same

Okay

Azzam

Any good resources for STL?

LMK plz

Anonymous

Any good resources for STL?

#cppbookguide

Anonymous

When I said: there is no difference, I meant, in terms of memory

Azzam

#cppbookguide

Tq

Azzam

When I said: there is no difference, I meant, in terms of memory

Okay

Azzam

Thanks

Anonymous

do some research, read (and buy) good books (Stroustrupo, Meyers, Herb, ...)

Anonymous

and you will understand

Artöm

in C there is no difference between int a[30][30]; and int a[30*30];When I said: there is no difference, I meant that the memory is contiguous

Types are different though

joai

can someone help me on this problem...this is past final test...i am newbie on using array

I will try it tomorrow. I'm also a beginner :v

Anonymous

🙋‍♂

Anonymous

/rules

Dhanrz

can someone help me on this problem...this is past final test...i am newbie on using array

#include<stdio.h> #include<conio.h> void main() { int a[50],n,i,j,dif,mdif; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++){ for(j=0;j<n;j++) { if(i!=j){ dif=abs(a[i]-a[j]); if(dif<=mdif) { mdif=dif; } } } } printf("%d",mdif); return ; }

olli

#include<stdio.h> #include<conio.h> void main() { int a[50],n,i,j,dif,mdif; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++){ for(j=0;j<n;j++) { if(i!=j){ dif=abs(a[i]-a[j]); if(dif<=mdif) { mdif=dif; } } } } printf("%d",mdif); return ; }

have you even tried running it?

MilkBeforeCereal

#include<stdio.h> #include<conio.h> void main() { int a[50],n,i,j,dif,mdif; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++){ for(j=0;j<n;j++) { if(i!=j){ dif=abs(a[i]-a[j]); if(dif<=mdif) { mdif=dif; } } } } printf("%d",mdif); return ; }

j=i+1 plox

Dhanrz

have you even tried running it?

It runs fyn

olli

It runs fyn

it does not produce the correct result

MilkBeforeCereal

It runs fyn

it's wrong

MilkBeforeCereal

you'll get diff as 0

MilkBeforeCereal

j=i+1 plox

.

Dhanrz

j=i+1 plox

It’s same a using if(i!=j)

MilkBeforeCereal

costly af

MilkBeforeCereal

It’s same a using if(i!=j)

altho I did miss that

MilkBeforeCereal

altho I did miss that

you're repeating the same steps unnecessarily

Dhanrz

I’m still a beginner;

Dhanrz

you're repeating the same steps unnecessarily

Plz suggest source to learn efficient algorithms

MilkBeforeCereal

I never learned anything like that myself

Talula

Plz suggest source to learn efficient algorithms

Logic

Ilya

Plz suggest source to learn efficient algorithms

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms. — 2nd. — MIT Press and McGraw-Hill, 2001. — ISBN 0-262-53196-8.

Anonymous

I need some notes on 2d array for class 12

olli

I need some notes on 2d array for class 12

All the array information you need https://en.cppreference.com/w/cpp/language/array

Anonymous

Boolean algebra

Anonymous

Hii

Anonymous

Can someone give me a real life application of a Binary search tree or simply a tree