Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- // Problem - 8
- int main() {
- int n;
- int flag = 1;
- scanf("%d", &n);
- int arr[n];
- for (int i = 0; i < n; i++) {
- scanf("%d", &arr[i]);
- }
- int choice;
- scanf("%d", &choice);
- int i;
- for (i = 0; i < n; i++) {
- if (arr[i] == choice) {
- printf("FOUND at index position: %d\n", i);
- flag = 0;
- }
- }
- if (i == n && flag == 1) {
- printf("NOT FOUND\n");
- }
- }
- // Problem - 6
- // int main() {
- // int n;
- // scanf("%d", &n);
- // int a[n];
- // for (int i = 0; i < n; i++) {
- // scanf("%d", &a[i]);
- // }
- // int max = a[0];
- // int index = 0;
- // for (int i = 1; i < n; i++) {
- // if (a[i] > max) {
- // max = a[i];
- // index = i;
- // }
- // }
- // printf("Max: %d, Index: %d\n", max, index);
- // }
- // Problem 1
- // int main() {
- // int size;
- // scanf("%d", &size);
- // int arr[size];
- // for (int i = 0; i < size; i++) {
- // scanf("%d", &arr[i]);
- // }
- // for (int i = size - 1; i >= 0; i--) {
- // printf("%d ", arr[i]);
- // }
- // printf("\n");
- // }
- // int main() {
- // int arr[5];
- // for (int i = 0; i < 5; i++) {
- // scanf("%d", &arr[i]);
- // }
- // printf("Values:\n");
- // for (int i = 0; i < 5; i++) {
- // printf("%d ", arr[i]);
- // }
- // printf("\n");
- // }
- /*
- Basics Of Array
- -> Array Printing
- -> Problems
- -> 1, 6, 8
- Basics of 2D Array
- -> 2D Array Printing
- -> Problems
- -> 21, 22, 24
- */
- /*
- Test Case:
- Problem - 1:
- 5
- 1 2 3 4 5
- 6
- 2 8 3 9 0 1
- Problem - 6:
- 5
- 1 2 3 4 5
- 6
- 2 8 3 9 0 1
- Problem - 8:
- 8
- 7 8 1 3 2 6 4 3
- 3
- 8
- 7 8 1 3 2 6 4 3
- 5
- Problem - 21:
- 9 8 7 6 5 4 3 2 1
- 1 1 1 2 2 2 3 3 3
- Problem - 22:
- 2 3
- 1 2 3
- 6 5 4
- 3 3
- 1 1 1
- 2 2 2
- 3 3 3
- Problem - 24:
- 5
- 1 2 3 4 5
- 5 4 3 2 1
- 2 2 2 2 2
- 6 7 8 9 0
- 1 9 3 7 4
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement