Array Programs with clear explanation
Вставка
- Опубліковано 21 вер 2019
- Follow my Whatsapp channel for content updates, questions, contests and many more...
whatsapp.com/channel/0029VaEh...
1.Ttraverse 8:00
2.insertion 10:52
3.deletion 17:21
4.Rversing 21:53
5.decimal to binary conversion 31:49
6.printing even numbers and odd numbers seperately 40:42
7.second largest element in array 48:00
8.Repeated element and count 1:00:40
9.Swap any 2 elements in an array using pointer 1:09:57
10.Swaping every pair of adjacent elements in an array 1:16:09
11.Rotate array elements k times 1:20:15
12.sum of elements in an array 1:30:14
Pointer programs with clear explanation
• Pointers for beginners...
Technical lectures by Shravan Kumar Manthri.
Watch Technical C programming
• Technical C coding : p...
Watch Data Warehousing & Data Mining
• 1. Multi-Dimensional ...
Watch Design & Analysis of Algorithms
• 1. Introduction to the...
Watch Formal Languages & Automata theory
• 1. Introduction to Aut...
Contact me @ fb : shravan.kites@gmail.com
Like us on fb: CSE GURUS
This video explains the concept of Arrays and typical programming.
This video explains 5 Mcq's with explanation related to Concepts in C . #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
Any one from brocamp
present!!
❤️❤️❤️❤️Brocamp legends 💕hit here
You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
the most precise video on youtube for array practice , love your channel
Glad to hear...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
While searching I found this gem 💎 thanks a lot man 🙏🙏
You are most welcome..You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
thank you sir ...it really helped .
wow amazing video sir made all videos like this means in one video plzz cover all possible concept related questions and theory part like in this video ,i highly recommend guys plzz do must watch till the end.great sir.thanks
Thank you. Keep Learning.
@@CSEGURUS Sir please make more videos related to data structure and algorithm.Thank you
@@CSEGURUS sir, post this kind of more videos on other data structure too
@@CSEGURUS look
The greatest c tutorial ....I have never seen in the entire UA-cam history! You deserve Oscar for your channel!!!
You made my day. Thank you...
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Wonderful video. Worth watching two hours to understand array programs. Thank you
Thank u...You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@31:21 , for reversing just the second half, 'j' too should be changed to (n-1).
thank you so much sir its,help me alot ,and i have learn new things,
Happy to hear from u..
You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
BROTOTYPE
Add l2= a[i-1] in the for loop
Very Helpful,, Very Good Explanation 👍
Thank you so much..You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
sir upload on pointers also...
tommorow is my interview and I'm glad that I've watched it
Konsi company ka tha aur kaisa gya
Great to hear...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@@crockgaming5958 RMSI
Congrats bro👏👏
Please upload for character array and string too, these videos are too helpful . Thank you so much
Will upload soon...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Wow thankyou so much...!!!
Most welcome…You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Srinivas sir explanation super thank you sir
You're most welcome...Thank u…You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
such a nice explanation
Glad you liked it...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
thank you this video
🥰
You’re welcome 😊
Sir TQ so much it is very helpful .😘😘😘
Most welcome and Glad to hear that.You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Very Good Explanation,Sir please make this type of Video on Linked List.
Sure I will....You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@@CSEGURUS sir can you share the link of previous question 1to 4
please sir keep posting these problem set solution.... It's hugely helpful for the beginners.
Sure I will...You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Thanks bro!
You are Welcome..You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Very helpful.... good explanation 👍👍
Glad it was helpful..You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Good classes
Easy to understand
Thanks a lot
You are welcome..
Hit the below link for best techniques in patterns in C. ua-cam.com/video/hWhMAoBhi7M/v-deo.html
thank you for the tutorial, best video ever
Glad it helped...
You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Thank you :):)
You're welcome!...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Sir tqq soo much i got this gem over thousands 🙏🙏
Most welcome and Many thanks...
Watch Top 90 Data Structures MCQs in the following link...
ua-cam.com/video/i2LTAJhkFf8/v-deo.html
Helpful 👍
Glad to hear that...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
This video is just awesome sir. Plz upload questions like this of other data structures sir . ☺️
Glad youm liked it...Watch Top 90 Data Structures MCQs in the following link...
ua-cam.com/video/i2LTAJhkFf8/v-deo.html
thank you thank u so much
Most welcome..You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
In Deletion is it necessary to write // if(position>=n+1) // Can we write // if(position>n) //
You are the best 😘😘😘😘
Happy to hear from you...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Sir , Can you please give this lecture pdf or doc .It will be very beneficial for revision.
I want to do more than like share subscriber...
Your videos are osm, This video helped me a lot ..... thankyou sir
So nice of you and very happy for that..
Watch all sortings with clear explanation in the following link..
www.udemy.com/course/draft/3956622/?referralCode=306AAC6206D9B4584A1B
thank you for informatiion
You are most Welcome..
Watch Top 90 Data Structures MCQs in the following link...
ua-cam.com/video/i2LTAJhkFf8/v-deo.html
Great video
Glad you enjoyed it...
You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Sir please add technical c programm which are asking in automata amcat in c and java
very helpful
Glad to hear that...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
In swapping adjacent elements for loop just go to limit-1
Please assume n is always odd.
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
Make videos on complete basic c programming with concept
You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Nice explanation
Thank u...You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Sir please make video on character array and string video having questions with explanation
Sure.. will be uploaded in july..You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
thanks sr🙏🏻
Most Welcome..
Watch all sortings with clear explanation in the following link..
www.udemy.com/course/draft/3956622/?referralCode=306AAC6206D9B4584A1B
Sir can u explain how to return a array in a function.
Respected sir please upload all programs on string..........it will be very helpful
will upload soon.
@@CSEGURUS Thank you sir, our placements starting in August sir so!
Sir my request you too please upload DSA Problems more ,
many guys want to place in company, please help us 🤝,many students ready to join if you start paid course on DSA
Thank u for ur concern..I vl upload programs soon.. Meanwhile.Watch Top 90 Data Structures MCQs in the following link...
ua-cam.com/video/i2LTAJhkFf8/v-deo.html
At 00:40 min code for decimal to binary is true only for decimal value >=4
For finding second largest element can we do in this way ?
Int n,a[50];
cin>>n;
For (int i=0;i>a[i];
}
For (int i=0;ia[i+1])
{
Int temp =a[i];
a[i] = a[i+1];
a[i+1] = temp;
}
}
cout
Please test with following input. n=5 , 50 20 16 67 25.
@@CSEGURUS i am getting answer as 25 which is wrong .
Thank you sir for realising my mistake 😄👍🏻
Sir , the problem in my program was it was just comparing the no. with the next no. right ?
Yes exactly...
@@saniyamansuri9607 bro the problem is that if the first number is lesser than the then the second number but greater than all the other numbers (second greatest)
ex. 80 , 85 , 48 , 2 , 3. in this case 80 is the second highest but in your code when for loop will run for the first time no swapping will happen but in second run 85 will be swapped by 48 and now in all case swapping will occur cause all other elements are lesser than 85 so 85 will reach at last index and in second last index there will be 3 not 80(second greatest)
@@saniyamansuri9607 in the code given by you its performing the task of getting only the greatest element in last index
not arranging in ascending order so you can't say that second greatest element will come in 2nd last index or not
Great explanation.
Sir what is the time complexity of insertion program?
As it may go through entire loop once so complexity is O(n).
@31:21 the second half will not swap after changing i =n/2+1 as u told...
Good explanation...but arrays programs are very hard....need lot of practise
Thank you.. Keep Practicing..You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
thanks
Most welcome...
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
Very nice video
Thank u very much...You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
sir plzz upload a video like this for others data structures too
Sure..Watch Top 90 Data Structures MCQs in the following link...
ua-cam.com/video/ot8QwCfOjfM/v-deo.html
Sir at 54:51 in else if condition after && why you wrote a[i]l1 was wrong means a[i] must lesser than l1 thats why only it came inside else if statement then why need to check it again
Hi sir in the program repeated element and count what will happen if already zero elements are there for example my array is
int a[6]={0,4,0,5,0,6};
I will upload a program for that with a different and very intersting logic.
instead of taking base value as 0 use base value as say INT_MAX or INT_MIN then you can even count 0's.
int a[50];
int n,i,count,j;
printf("Enter the number of elements in an array");
scanf("%d",&n);
printf("enter the values for elements");
for(i=0; i
traverse 8:00
insertion 10:52
deletion 17:21
reversing 21:53
decimal to binery conversion 31:49
printing even numbers and odd numbers seperately 40:42
second largest element in array 48:00
repeated element and count 1:00:40
swap any 2 elements in an array using pointer 1:09:57
swaping every pair of adjacent elements in an array 1:16:09
rotate array elements k times 1:20:15
sum of elements in an array 1:30:14
Many thanks for u..
You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
please make this video for c++
I will make it.
Even and odd number 47:00
Ur explanation is nice .Can u pls provide link for same type of video on topics of pointers,structures,strings ?
Thank you.. You can watch pointers clearly explaned here ua-cam.com/video/yDavIqD3_9I/v-deo.html
You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@49:52
🔥🔥
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
🙏
Thank you..…You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
Sir what if user enters zéro twice in an Array (in Example repeated élément and count ) then it will to be ignored.then how to solve that issue ? 🧐.
Can we initialize that Array to. " NULL"??
Use onemore array as count with max size and initialize to 0. i vl upload this method soon.
OK sir 🙏😇
#include
#include
int main()
{
int arr[] = {22, 11, 34, 11, 3, 4, 0, 3, 0, 34,0};
int len = sizeof(arr) / sizeof(int), c;
for (int i = 0; i < len; i++)
{
c = 1;
for (int j = i + 1; j < len; j++)
{
if (arr[i] == INT_MIN)
{
continue;
}
if (arr[i] == arr[j])
{
c++;
arr[j] = INT_MIN;
}
}
if (c > 1)
{
printf("%d repeated %d times
", arr[i], c);
}
}
return 0;
}
sir array insertion code is showing stack smashing at the output console what next and the code has been terminated without showing any result
For repeated element and count
What if the input array has repeating elements as 0 like
{0,1,0,0,1,2}
For prime numbers can we write
If (a[i]%1==0 && a[i]%a[i]==0)
No
I have one doubt how can u assign are[2]=-10 in simple program please telmy
Yes. u can.
there are some mistakes in the codes
Bototype student like
1st view
Thank you. Keep Learning.
binery convertion this is also posible
#include
int main()
{
int i,r,a[50],n;
printf("enter the size");
scanf("%d",&n);
for(i-0;n!=0;i++){
r=n%2;
a[i]=r;
n=n/2;
}
for(i=i-1;i>=0;i--)
printf("\t%d",a[i]);
return 0;
}
This is for class 10 icse
ok
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
@@CSEGURUS sir watched it your lectures are very good I have done loops also please guide me
sir in last question about prime numbers
how can we say if the number is not divisible by 2,3,5,7 then it will be prime cause
Take the example of 143.
143 = 11*13.
143 is not a prime number, though it is not divisible by 2, 3, 5 and 7.
someone please explain this
Please check the constraints for n. where 2
@@CSEGURUS n means elements in array ?? means this method is applicable is n(element in array ) is less than 100 and sir please answer my other questions also i posted in comment section
i
Your brackets are simply missing after the loops .Can you explain me
Can u mention the program or timeline.
@@CSEGURUS insertion at position.. 2 nd for loop
why you have written "for loop" for i and j both in the single for loop.. this is very confusing..
Maximum program is throwing error.
where is the continuation video sir
Watch all sortings with clear explanation in the following link..
www.udemy.com/course/draft/3956622/?referralCode=306AAC6206D9B4584A1B
Sir for me What I'm inserting is repeating twice
send me ur code to csegurus@gmail.com
Second largest sum is wrong while taking numbers 12345
Bro. Is sub array ,large array programming questions are there in this channel if it is there please provide link
You can watch this playlist for more stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html
@26:27
I think..a number not divisible by 2,3 and 7 doesn't make sure that this is prime...for example..17*13 is a number not divisible by 2 3 and 7 ..but it is not prime...so please check it again...
Please check the constraints. The input number should be in between 2 to 100. then only this logic is applicable.
@@CSEGURUS oops.. sorry..i might not notice that.. really very sorry for this comment..
2nd half reverse is not working by your logic
Watch “Operators in C - Tips and Tricks” in the following link
ua-cam.com/video/tmFkBx362yw/v-deo.html
Found many logical error in your code
SECOND LARGEST NUMBER
#include
int main()
{
int i,j,a[20],temp,n;
printf("Enter a number of element in array");
scanf("%d",&n);
printf("Enter %d elements
",n);
for(i=0;i
I think ur code is with complexity O(n^2). where as i have written with O(n) complexity.. Pls verify..
thank you so much
You're welcome...You can watch this playlist for placement related stuff in C
ua-cam.com/play/PLYT7YDstBQmEGhVqAoubBS0OE_5m4JDUe.html