Great Bhai! Kuch suggest Karo na... Platina par kaise mods acche lagenge

does it bend easily on falls like stock handle bar of himalayan 450? is it alloy or cast iron?

Handle bar for himalayan 450? which model is suited? is there any advantage over stock handle bar.

Which clutch cable did you use?

Thank you for the much needed video. I'm a DIY guy and was looking for information on this. Cheers

//Quick sort// #include <stdio.h> int main() { int n, i, j, pivot, temp; printf("Enter the number of elements: "); scanf("%d", &n); int arr[n]; printf("Enter %d integers: ", n); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } // Quicksort implementation (without functions) i = 0; // Lower index j = n - 1; // Upper index // Choose the last element as the pivot (can be modified) pivot = arr[j]; while (i <= j) { // Move elements less than the pivot to the left side while (arr[i] < pivot) { i++; } // Move elements greater than the pivot to the right side while (arr[j] > pivot) { j--; } // If elements on both sides are misplaced, swap them if (i <= j) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; j--; } } printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } printf(" "); return 0; }

22. Filehandling program 7 #include <stdio.h> void main () { FILE *fp; char ch; clrscr(); fp = fopen ("f7.c","r"); while(1) { ch=fgetc(fp); if (feof(fp) ) { break; } printf ("%c",ch); } fclose(fp); getch(); }

21. File handling program 6 #include <stdio.h> void main () { FILE *fp; int n; clrscr(); fp = fopen ("t3.txt","w+r"); while(1) { printf (" Enter Any Number "); scanf ("%d",&n); if (n == 0 ) { break; } fprintf (fp,"%d ",n); } rewind (fp); while(1) { fscanf (fp,"%d",&n); if (feof (fp)) { break; } printf ("%d ",n); } fclose(fp); getch(); }

20. File handling program 5 #include <stdio.h> void main () { FILE *fp; int n; clrscr(); fp = fopen ("t2.txt","r"); while(1) { fscanf (fp,"%d",&n); if (feof (fp)) { break; } printf ("%d ",n); } fclose(fp); getch(); }

19. File handling program 4 #include <stdio.h> void main () { FILE *fp; int n; clrscr(); fp = fopen ("t2.txt","a"); while(1) { printf (" Enter Any Number "); scanf ("%d",&n); if (n == 0 ) { break; } fprintf (fp,"%d ",n); } fclose(fp); getch(); }

18. File handling program 3 #include <stdio.h> void main () { FILE *fp; int n; fp = fopen ("t2.txt","w"); while(1) { printf (" Enter Any Number "); scanf ("%d",&n); if (n == 0 ) { break; } fprintf (fp,"%d ",n); } fclose(fp); getch(); }

17. File handling program 2 #include <stdio.h> void main () { FILE *fp; char str[100]; clrscr(); fp = fopen ("t1.txt","r"); // fscanf (fp,"%s",str); fgets(str,99,fp); printf (" Given String %s",str); getch(); }

16. File handling program 1 #include <stdio.h> void main () { FILE *fp; fp = fopen ("t1.txt","w"); clrscr(); fprintf (fp,"Hello World"); fclose (fp); getch(); }

15. Write a program for double ink list #include <stdio.h> struct Node { struct Node *prev; int data; struct Node *next; }*start = NULL,*end=NULL; void AddNode (int d) { struct Node *newNode; newNode = (struct Node*)malloc ( sizeof (struct Node ) ); newNode->prev = NULL; newNode->data = d; newNode->next = NULL; if (start == NULL ) { start=end = newNode; } else { end ->next =newNode; newNode->prev = end; end = newNode; } } void displayLR () { struct Node *temp; temp = start; while (temp!=NULL) { printf (" %d",temp->data); temp = temp->next; } } void displayRL () { struct Node *temp; temp = end; while (temp!=NULL) { printf (" %d",temp->data); temp = temp->prev; } } void main () { int opt,d; clrscr(); do { printf (" 1.Add to Node "); printf (" 2.Display from Start to end "); printf (" 3.Display from End to start "); printf (" Enter your option "); scanf ("%d",&opt); switch (opt) { case 1: printf (" Enter Data to Add "); scanf ("%d",&d); AddNode (d); break; case 2: displayLR(); break; case 3: displayRL(); break; } getch(); clrscr(); }while (opt == 1 || opt==2 || opt == 3); }

12. Write program for insertion and deletion in single linklist #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node *next; }*Start = NULL; void AddNode(int d) { struct Node *temp, *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = d; newNode->next = NULL; if (Start == NULL) { Start = newNode; } else { temp = Start; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } } void display() { struct Node *temp; temp = Start; while (temp != NULL) { printf(" %d", temp->data); temp = temp->next; } } void AddFirst(int d) { struct Node *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = d; newNode->next = Start; Start = newNode; } void DelLast() { struct Node *temp, *prev; temp = Start; while (temp->next != NULL) { prev = temp; temp = temp->next; } prev->next = NULL; free(temp); } void DelFirst() { struct Node *temp; temp = Start; Start = temp->next; free(temp); } void Count() { int cnt = 0; struct Node *temp; temp = Start; while (temp != NULL) { cnt++; temp = temp->next; } printf(" Number of Nodes: %d", cnt); } int main() { int choice, data; do { printf(" 1. Add Node"); printf(" 2. Add Node at First Position"); printf(" 3. Delete First Node"); printf(" 4. Delete Last Node"); printf(" 5. Display Nodes"); printf(" 6. Count Nodes"); printf(" 7. Exit"); printf(" Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf(" Enter data to add: "); scanf("%d", &data); AddNode(data); break; case 2: printf(" Enter data to add at first position: "); scanf("%d", &data); AddFirst(data); break;//not sure about this case 3: DelFirst(); break; case 4: DelLast(); break; case 5: display(); break; case 6: Count(); break; case 7: exit(0); } } while (1); return 0; }

11. Write a program for creation and traverse of Single linklist. #include <stdio.h> struct Node { int data; struct Node *next; }*Start = NULL; void AddNode (int d) { struct Node *temp,*newNode; newNode = (struct Node*)malloc ( sizeof (struct Node ) ); newNode->data = d; newNode->next = NULL; if (Start == NULL ) { Start = newNode; } else { temp = Start; while (temp->next !=NULL ) { temp = temp->next; } temp ->next =newNode; } } void display () { struct Node *temp; temp = Start; while (temp!=NULL) { printf (" %d",temp->data); temp = temp->next; } } void main () { clrscr(); AddNode (10); AddNode(20); AddNode(30); AddNode (40); AddNode (50); display(); getch(); }

10. Check whether the string is palindrome or not using stack. #include<stdio.h> #include<conio.h> struct Stack { char a[50]; int top; }S; void Push ( char d ) { S.top++; if (S.top > 49 ) { printf (" Stack is Full "); S.top = 49; } else { S.a[S.top] = d; } } int Pop () { char d ; if (S.top < 0 ) { printf (" Stack is Empty "); return -1; } else { d = S.a[S.top]; S.top--; return d; } } void main () { int i,flg; char str[50],ch; clrscr(); S.top = -1; printf (" Enter String "); scanf ("%s",str); for (i=0;str[i]!='\0';i++) { Push (str[i]); } i = 0; flg = 0; for (i=0;str[i]!='\0';i++) { ch = Pop (); if ( str[i] != ch ) { flg = 1; break; } } if (flg == 1 ) { printf (" String not Pallindrome "); } else { printf (" String is Pallindrome "); } getch(); }

9. Write a program to convert decimal value into binary using stack. #include<stdio.h> #include<conio.h> struct Stack { int a[16]; int top; }S; void Push ( int d ) { S.top++; if (S.top > 15 ) { printf (" Stack is Full "); S.top = 15; } else { S.a[S.top] = d; } } int Pop () { int d ; if (S.top < 0 ) { printf (" Stack is Empty "); return -1; } else { d = S.a[S.top]; S.top--; return d; } } void main () { int n,r; clrscr(); S.top = -1; printf (" Enter Any Decimal Number "); scanf ("%d",&n); while ( n > 0 ) { r = n % 2; Push (r); n = n / 2; } while (S.top != -1 ) { printf ("%d",Pop()); } getch(); }

8. Write a program for queue and its operations #include<stdio.h> #include<conio.h> struct Queue { int a[5]; int fr,rr; }S; void AddQ ( int d ) { S.rr++; if ( S.rr > 4 ) { printf (" Queue is Full "); S.rr = 4; } else { S.a[S.rr] = d; } } int DelQ () { int d; if ( S.fr > S.rr ) { printf (" Queue is Empty "); S.fr = 0; S.rr = -1; return -1; } else { d = S.a[S.fr]; S.fr++; return d; } } void main () { int opt,d; clrscr(); S.fr = 0; S.rr = -1; do { printf (" 1.Add to Queue "); printf (" 2.Delete from Queue "); printf (" Enter your option "); scanf ("%d",&opt); switch (opt) { case 1: printf (" Enter Data to Add in Queue "); scanf ("%d",&d); AddQ (d); break; case 2: printf (" Deleted Element %d",DelQ()); break; } getch(); clrscr(); }while (opt == 1 || opt==2 ); }

7. Stack operation menu driven program #include<stdio.h> #include<conio.h> struct Stack { int a[5]; int top; }S; void Push ( int d ) { S.top++; if ( S.top > 4 ) { printf (" Stack is Full"); S.top = 4; } else { S.a[S.top] = d; } } int Pop () { int d ; if (S.top < 0 ) { printf (" Stack is Empty "); return -1; } else { d = S.a[S.top]; S.top--; return d; } } void main () { int opt,d; clrscr(); S.top = -1; do { printf (" 1.Push"); printf (" 2.Pop "); printf (" Enter your option "); scanf ("%d",&opt); switch (opt) { case 1: printf (" Enter Data to Push "); scanf ("%d",&d); Push (d); break; case 2: printf (" Popped Element %d",Pop()); break; } getch(); clrscr(); }while (opt == 1 || opt==2 ); }

5. Write a program for binary search. #include<stdio.h> #include<conio.h> void main () { int a[5],i,l,h,n,m,flg; clrscr(); printf (" Enter Five Numbers "); for (i=0;i<5;i++) { scanf ("%d",&a[i]); } printf (" Enter Number to Search "); scanf ("%d",&n); flg=0; l=0; h=4; while (l<=h ) { m = (l+h) / 2; if (a[m] == n ) { flg = 1; break; } else if ( n > a[m] ) { l = m + 1; } else { h = m - 1; } } if ( flg == 0 ) { printf (" Number is Missing "); } else { printf (" Number is Present"); } getch(); }

4. Write a program for linear search. #include<stdio.h> #include<conio.h> void main () { int a[5],i,n,flg; clrscr(); printf (" Enter Five Numbers "); for (i=0;i<5;i++) { scanf ("%d",&a[i]); } printf (" Enter Number to Search "); scanf ("%d",&n); flg=0; for (i=0;i<5;i++) { if (a[i] == n ) { flg = 1; break; } } if ( flg == 0 ) { printf (" Number is Missing "); } else { printf (" Number is Present"); } getch(); }

3. Write a program for insertion sort. #include<stdio.h> #include<conio.h> void main () { int a[5]; int i,j,t; clrscr (); printf (" Enter Five Elements "); for (i=0;i<5;i++) { scanf ("%d",&a[i]); } printf (" Given Five Elements "); for (i=0;i<5;i++) { printf (" %d",a[i]); } for (i=1;i<5;i++) { t = a[i]; j=i-1; while ( j >= 0 && a[j] > t ) { a[j+1] = a[j]; j--; } a[j+1] = t; } printf (" After Sorting "); for (i=0;i<5;i++) { printf (" %d",a[i]); } getch(); }

2. Write a program for bubble sort #include<stdio.h> #include<conio.h> void main () { int a[5]; int i,j,t; clrscr (); printf (" Enter Five Elements "); for (i=0;i<5;i++) { scanf ("%d",&a[i]); } printf (" Given Five Elements "); for (i=0;i<5;i++) { printf (" %d",a[i]); } for (i=0;i<4;i++) { for (j=0;j<4-i;j++) { if (a[j] > a[j+1]) { t = a[j]; a[j] = a[j+1]; a[j+1] = t; } } } printf (" After Sorting "); for (i=0;i<5;i++) { printf (" %d",a[i]); } getch(); }

1.Write a program for selection sort #include<stdio.h> #include<conio.h> void main() { int arr[5]; int i,j,t; clrscr(); printf("Enter the five elements "); for(i=0;i<5;i++) { scanf("%d",&arr[i]); } printf("Give Elements are "); for(i=0;i<5;i++) { printf(" %d",arr[i]); } for(i=0;i<4;i++) { for(j=i+1; j<5;j++) { if(arr[i]>arr[j]) { t=arr[i]; arr[i]=arr[j]; arr[j]=t; } } } printf(" After Sorting"); for(i=0;i<5;i++) { printf(" %d",arr[i]); } getch(); }

#include <stdio.h> int main() { int arr[100], n, i, x, pos; printf("Enter the number of elements in the array "); scanf("%d", &n); printf("Enter the elements "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } printf("Input array elements are: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } printf(" Enter the new element to be inserted: "); scanf("%d", &x); printf("Enter the position where element is to be inserted: "); scanf("%d", &pos); // Check for valid position if (pos < 0 || pos > n) { printf("Invalid position "); return 1; } // Shift elements to make space for insertion for (i = n - 1; i >= pos - 1; i--) { arr[i + 1] = arr[i]; } // Insert the element at the specified position arr[pos - 1] = x; // Increase the size of the array (logical size, not actual size) n++; printf(" Array after insertion: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } return 0; }

__

Sir, just one question(maybe you’ve explain the reason in the video but I apologize that I know only english and chinese) why you lubricate on the outside of the chain instead of the inside where everyone on RU-vid or other website told us to lubricate the inside the chain? Just want to know the reason and learn something new, not trying to raise any argument😅

Which bike's front fork is that?

,

Where is Installion Video

Bhai apka nob send kro

Ya handle bar kaha say kharidu

hello bro mere bike me 2000km chalne ke bad engine oil khatm ho ja rha he kya problem ho sakta please help

Bro your contact number please

Very nice initiative brother keep it up 👍🏾

Karizma Ko Khacchar Bana Dia Bhai Tune

Kaha se liye ho

Bhai rear tyre 🛞 kolne Ka bhi video bhi post kro z800

Filter keha gaya

I break that bolt 1:17 😅

Price ??

Bro 10w50 ns 200 me bhi chalnjayega na.. manula me tho 20w50 and 10w50 dono mentioned h.. what is your opinion brthr?

Bhai contact number

Bhai kahan se ho my mere ko bhi sikhane Gaye Kawasaki ka

Fhfy

Price kya hai bhai?

Bhiya discover nhi ka passion pro me lag jaye ga

👍👍

How much wider than stock