From 2327012f0e4613c4f780923d7b9e9475246722f9 Mon Sep 17 00:00:00 2001 From: Devagn Maniya <99108074+devagn611@users.noreply.github.com> Date: Sat, 5 Oct 2024 15:46:14 +0530 Subject: [PATCH] pattern_upload_c --- pattern/Inverted-Left-Half-Pyramid-Pattern.c | 21 +++++ pattern/Inverted-Right-Half-Pyramid-Pattern.c | 16 ++++ pattern/Inverted-full-pyrm.c | 42 +++++++++ pattern/Rhombus-pattern.c | 21 +++++ pattern/diamond.c | 64 ++++++++++++++ pattern/full-pyrm.c | 48 +++++++++++ pattern/left-hal-pyrm.c | 25 ++++++ pattern/right-hal-pyrm.c | 14 +++ pattern/second-largest.c | 85 +++++++++++++++++++ pattern/tempCodeRunnerFile.c | 21 +++++ 10 files changed, 357 insertions(+) create mode 100644 pattern/Inverted-Left-Half-Pyramid-Pattern.c create mode 100644 pattern/Inverted-Right-Half-Pyramid-Pattern.c create mode 100644 pattern/Inverted-full-pyrm.c create mode 100644 pattern/Rhombus-pattern.c create mode 100644 pattern/diamond.c create mode 100644 pattern/full-pyrm.c create mode 100644 pattern/left-hal-pyrm.c create mode 100644 pattern/right-hal-pyrm.c create mode 100644 pattern/second-largest.c create mode 100644 pattern/tempCodeRunnerFile.c diff --git a/pattern/Inverted-Left-Half-Pyramid-Pattern.c b/pattern/Inverted-Left-Half-Pyramid-Pattern.c new file mode 100644 index 0000000..a1fc69b --- /dev/null +++ b/pattern/Inverted-Left-Half-Pyramid-Pattern.c @@ -0,0 +1,21 @@ +#include + +int main(int argc, char const *argv[]) +{ + + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < 2 * i; j++) + { + printf(" "); + } + for (int k = 0; k < rows - i; k++) + { + printf("* "); + } + printf("\n"); + } + return 0; +} diff --git a/pattern/Inverted-Right-Half-Pyramid-Pattern.c b/pattern/Inverted-Right-Half-Pyramid-Pattern.c new file mode 100644 index 0000000..8b9eeda --- /dev/null +++ b/pattern/Inverted-Right-Half-Pyramid-Pattern.c @@ -0,0 +1,16 @@ +#include + +int main(int argc, char const *argv[]) +{ + + int rows=5; + for (int i = 0; i < rows; i++) + { + for (int j = 0; j < rows-i ; j++) + { + printf("*"); + } + printf("\n"); + } + return 0; +} diff --git a/pattern/Inverted-full-pyrm.c b/pattern/Inverted-full-pyrm.c new file mode 100644 index 0000000..899f13f --- /dev/null +++ b/pattern/Inverted-full-pyrm.c @@ -0,0 +1,42 @@ +#include + +int main(int argc, char const *argv[]) +{ + + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < rows + i; j++) + { + printf(" "); + } + for (int k = 0; k < rows - i; k++) + { + printf("* "); + } + printf("\n"); + } + return 0; +} + + +//extra +// int main() +// { +// int rows = 5; + + +// for (int i = 0; i < rows; i++) { + + +// for (int j = 0; j < 2 * i; j++) { +// printf(" "); +// } + +// for (int k = 0; k < 2 * (rows - i) - 1; k++) { +// printf("* "); +// } +// printf("\n"); +// } +// } \ No newline at end of file diff --git a/pattern/Rhombus-pattern.c b/pattern/Rhombus-pattern.c new file mode 100644 index 0000000..db4a5eb --- /dev/null +++ b/pattern/Rhombus-pattern.c @@ -0,0 +1,21 @@ +#include + +int main(int argc, char const *argv[]) +{ + + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < rows - i; j++) + { + printf(" "); + } + for (int k = 0; k < rows; k++) + { + printf("* "); + } + printf("\n"); + } + return 0; +} diff --git a/pattern/diamond.c b/pattern/diamond.c new file mode 100644 index 0000000..28eacce --- /dev/null +++ b/pattern/diamond.c @@ -0,0 +1,64 @@ +#include + +int main(int argc, char const *argv[]) +{ + // static approach + // int rows = 5; + + // for (int i = 0; i < rows; i++) + // { + + // for (int l = 0; l < rows - i; l++) + // { + // if (l == 0) + // { + // printf(" "); + // } + // printf(" "); + // } + // for (int m = 0; m <= i; m++) + // { + // printf("* "); + // } + // printf("\n"); + // } + // for (int i = 0; i < rows; i++) + // { + // for (int j = 0; j < rows + i; j++) + // { + // printf(" "); + // } + // for (int k = 0; k < rows - i; k++) + // { + // printf("* "); + // } + // printf("\n"); + // } + // return 0; + + // dynamic one + int n = 5; + + + for (int i = 0; i < 2 * n - 1; i++) { + // the row number + int comp; + if (i < n) { + comp = 2 * (n - i) - 1; + } + else { + comp = 2 * (i - n + 1) + 1; + } + + // space + for (int j = 0; j < comp; j++) { + printf(" "); + } + + for (int k = 0; k < 2 * n - comp; k++) { + printf("* "); + } + printf("\n"); + } + return 0; +} diff --git a/pattern/full-pyrm.c b/pattern/full-pyrm.c new file mode 100644 index 0000000..3ef4ad3 --- /dev/null +++ b/pattern/full-pyrm.c @@ -0,0 +1,48 @@ +// #include + +// int main() +// { +// int rows = 5; +// for (int i = 0; i < rows; i++) +// { + +// for (int j = 0; j < (rows - i); j++) +// { +// printf(" "); +// } + +// for (int k = 0; k <= i; k++) +// { +// printf("* "); +// } +// for (int j = 0; j < (rows - i) ; j++) +// { +// printf(" "); +// } +// printf("\n"); +// } +// return 0; +// } + + +#include + +int main() +{ + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < (rows - i); j++) + { + printf(" "); + } + + for (int k = 0; k <= i; k++) + { + printf("* "); + } + printf("\n"); + } + return 0; +} \ No newline at end of file diff --git a/pattern/left-hal-pyrm.c b/pattern/left-hal-pyrm.c new file mode 100644 index 0000000..9bda84b --- /dev/null +++ b/pattern/left-hal-pyrm.c @@ -0,0 +1,25 @@ +#include + +int main() +{ + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < 2 * (rows - i) - 1; j++) + { + printf(" "); + } + + for (int k = 0; k <= i; k++) + { + printf("* "); + } + for (int j = 0; j < 2 * (rows - i) - 1; j++) + { + printf(" "); + } + printf("\n"); + } + return 0; +} \ No newline at end of file diff --git a/pattern/right-hal-pyrm.c b/pattern/right-hal-pyrm.c new file mode 100644 index 0000000..0338afb --- /dev/null +++ b/pattern/right-hal-pyrm.c @@ -0,0 +1,14 @@ +#include + +int main() +{ + + for (int i = 5; i < 0; i--){ + printf(" "); + for (int j = i; j < i; j--) + { + printf("%d", j+1); + } + + } +} \ No newline at end of file diff --git a/pattern/second-largest.c b/pattern/second-largest.c new file mode 100644 index 0000000..f2752b3 --- /dev/null +++ b/pattern/second-largest.c @@ -0,0 +1,85 @@ +#include + +void bubbleSort(int arr[], int n) { + for (int i = 0; i < n-1; i++) { + for (int j = 0; j < n-i-1; j++) { + if (arr[j] > arr[j+1]) { + int temp = arr[j]; + arr[j] = arr[j+1]; + arr[j+1] = temp; + } + } + } +} + +int secondLargest(int arr[], int n) { + if (n < 2) return -1; // size is not enough + // final result + for (int i = n-2; i >= 0; i--) { + if (arr[i] != arr[n-1]) { + return arr[i]; + } + } + return -1; +} + +int main() { + int arr[] = {12, 35, 10000, 1, 34, 10000}; + int n = sizeof(arr) / sizeof(arr[0]); + bubbleSort(arr, n); + int result = secondLargest(arr, n); + + if (result == -1) { + printf("There is no second largest element\n"); + } else { + printf("The second largest element is %d\n", result); + } + + return 0; +} + + + + + +// #include +// #include + +// int findSecondLargest(int arr[], int size) { +// if (size < 2) { +// printf("Array should have at least two elements.\n"); +// return INT_MIN; +// } + +// int firstLargest, secondLargest; +// firstLargest = secondLargest = INT_MIN; + +// for (int i = 0; i < size; i++) { +// if (arr[i] > firstLargest) { +// secondLargest = firstLargest; +// firstLargest = arr[i]; +// } else if (arr[i] > secondLargest && arr[i] != firstLargest) { +// secondLargest = arr[i]; +// } +// } + +// if (secondLargest == INT_MIN) { +// printf("There is no second largest element.\n"); +// return INT_MIN; +// } + +// return secondLargest; +// } + +// int main() { +// int arr[] = {12, 35, 1, 10, 34, 100}; +// int size = sizeof(arr) / sizeof(arr[0]); + +// int secondLargest = findSecondLargest(arr, size); + +// if (secondLargest != INT_MIN) { +// printf("The second largest element is %d\n", secondLargest); +// } + +// return 0; +// } diff --git a/pattern/tempCodeRunnerFile.c b/pattern/tempCodeRunnerFile.c new file mode 100644 index 0000000..8a7489e --- /dev/null +++ b/pattern/tempCodeRunnerFile.c @@ -0,0 +1,21 @@ +#include + +int main(int argc, char const *argv[]) +{ + + int rows = 5; + for (int i = 0; i < rows; i++) + { + + for (int j = 0; j < rows + i; j++) + { + printf(" "); + } + for (int k = 0; k < rows - i; k++) + { + printf("* "); + } + printf("\n"); + } + return 0; +}