├── Array ├── 001 Find the sum of all elements of the array.c ├── 002 Find the average of n numbers.c ├── 003 Find Sum of even numbers in an Array.c ├── 004 Find Sum of odd numbers in an Array.c ├── 005 Find Average of even numbers in an Array.c ├── 006 Find Average of odd numbers in an Array.c ├── 007 Copy the elements of one array into another array.c ├── 008 Find largest element in an array without sorting.c ├── 009 Separate odd and even integers in separate arrays.c ├── 010 Find smallest element in an array without sorting.c ├── 011 Reverse an array without using an additional array.c ├── 012 Insert New value in an unsorted array at a specific position.c ├── 013 Sort elements of array in ascending order.c ├── 014 Sort elements of array in descending order.c ├── 015 Insert New value in a sorted array.c ├── 016 Move all zeros to the beginning of an array without sorting.c ├── 017 Move all zeros to the end of an array.c ├── 018 Move all negative numbers to the beginning of an array without sorting.c ├── 019 Merge two unsorted arrays in sorted order.c ├── 020 Find second largest element in an array without sorting.c ├── 021 Find second smallest element in an array without sorting.c ├── 022 Count the frequency of each element of an array.c ├── 023 Print all unique elements in an array.c ├── 024 Print duplicate elements in an array.c ├── 025 Find most repeated number in an array.c ├── 026 Find array elements that occur 2 times in the array.c ├── 027 Find prime numbers in an array.c ├── 028 Find non-prime numbers in an array.c ├── 029 Remove all the odd numbers in an array.c ├── 030 Remove all the even numbers in an array.c ├── 031 Remove all the prime numbers in an array.c ├── 032 Find non-prime numbers in an array and insert their double after the same.c ├── 033 Replace prime numbers by their index position.c ├── 034 Remove all the duplicate elements in an array.c ├── 035 Remove all the prime numbers > 50 and remove all the non-prime numbers.c ├── 036 Find unique non-prime numbers in an array.c ├── 037 Delete two elements after the occurrence of an even number.c ├── 038 Delete two elements after the occurrence of a prime number.c ├── 039 Delete two elements after the occurrence of an odd number.c ├── 040 Delete three elements after the occurrence of a prime number.c ├── 041 Find third largest number in an array.c ├── 042 Find third smallest number in an array.c ├── 043 Find Average of Prime and non prime numbers in an array.c ├── 044 Find the maximum and minimum element in an array.c ├── 045 C program to replace all prime numbers by 0 & even numbers by 1 in an array.c ├── 046 Remove odd numbers and find sum of the existing values in the array.c ├── 047 Find the average of all unique array elements.c ├── 048 Delete an element from an array at specified position.c ├── 049 Find factorial of largest number in an array.c ├── 050 If array sum is greater than 100 delete odd, if sum is less than 100 delete even numbers.c ├── 051 Delete smallest element in an array.c └── 052 find the majority element in the array.c ├── LICENSE ├── Pattern ├── 01 : Introduction to C Programming Patterns.c ├── 02 : Simple Patterns.c ├── 03 : Basic Number patterns.c ├── 04 : Advanced Star & Number patterns.c ├── 05 : Alphabet Patterns.c ├── 06 : F - E - Ladder patterns.c ├── 07 : Spaced Patterns.c └── 08 : Shape Pattern.c └── README.md /Array/001 Find the sum of all elements of the array.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int num[100],i,size,j,sum=0; 4 | printf("Enter the size of array : "); 5 | scanf("%d",&size); 6 | printf("Enter the elements : \n"); 7 | for(i=0;i 2 | int main() { 3 | int num[20],size,i; 4 | float sum=0,avg; 5 | printf("Enter Array Size : "); 6 | scanf("%d",&size); 7 | printf("Enter the elements : "); 8 | for(i=0;i 2 | 3 | int main() { 4 | int num[20], size, i, sumEven = 0; 5 | 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | 9 | printf("Enter the elements : "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &num[i]); 12 | } 13 | 14 | // Check if the number is even 15 | for (i = 0; i < size; i++) { 16 | if (num[i] % 2 == 0) { 17 | sumEven += num[i]; 18 | } 19 | } 20 | 21 | printf("Sum of even numbers is : %d", sumEven); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Array/004 Find Sum of odd numbers in an Array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, sumOdd = 0; 5 | 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | 9 | printf("Enter the elements : "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &num[i]); 12 | 13 | // Check if the number is odd 14 | if (num[i] % 2 != 0) { 15 | sumOdd += num[i]; 16 | } 17 | } 18 | 19 | printf("Sum of odd numbers is : %d", sumOdd); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Array/005 Find Average of even numbers in an Array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, countEven = 0; 5 | float sum = 0, avg; 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | printf("Enter the elements : "); 9 | for (i = 0; i < size; i++) { 10 | scanf("%d", &num[i]); 11 | if (num[i] % 2 == 0) { 12 | sum += num[i]; 13 | countEven++; 14 | } 15 | } 16 | if (countEven == 0) { 17 | printf("No even numbers entered, cannot calculate average."); 18 | } else { 19 | avg = sum / countEven; 20 | printf("Average of even numbers is : %f", avg); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Array/006 Find Average of odd numbers in an Array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, countOdd = 0; 5 | float sum = 0, avg; 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | printf("Enter the elements : "); 9 | for (i = 0; i < size; i++) { 10 | scanf("%d", &num[i]); 11 | if (num[i] % 2 == 1) { 12 | sum += num[i]; 13 | countOdd++; 14 | } 15 | } 16 | if (countOdd == 0) { 17 | printf("No odd numbers entered, cannot calculate average."); 18 | } else { 19 | avg = sum / countOdd; 20 | printf("Average of odd numbers is : %f", avg); 21 | } 22 | return 0; 23 | } 24 | 25 | -------------------------------------------------------------------------------- /Array/007 Copy the elements of one array into another array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr1[20], arr2[20], size, i; 5 | 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | 9 | printf("Enter the array elements : "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &arr1[i]); 12 | } 13 | for (i = 0; i < size; i++) { 14 | arr2[i] = arr1[i]; 15 | } 16 | 17 | printf("Array 2 Elements : "); 18 | 19 | for (i = 0; i < size; i++) { 20 | printf("%d\t",arr2[i]); 21 | } 22 | 23 | return 0; 24 | } 25 | 26 | //Copying when reading array itself 27 | // for (i = 0; i < size; i++) { 28 | // scanf("%d", &arr1[i]); 29 | // arr2[i] = arr1[i]; 30 | // } -------------------------------------------------------------------------------- /Array/008 Find largest element in an array without sorting.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, max; 5 | 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | 9 | printf("Enter the elements : "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &num[i]); 12 | } 13 | max = num[0]; 14 | for (i = 1; i < size; i++) { 15 | if( num[i] > max ) { 16 | max = num[i]; 17 | } 18 | } 19 | printf("Largest element in the array is : %d", max); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Array/009 Separate odd and even integers in separate arrays.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i; 5 | int even[20], odd[20]; 6 | int evenCount = 0, oddCount = 0; 7 | 8 | printf("Enter Array Size : "); 9 | scanf("%d", &size); 10 | 11 | printf("Enter the elements : "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &num[i]); 14 | 15 | // Separate even and odd numbers 16 | if (num[i] % 2 == 0) { 17 | even[evenCount] = num[i]; 18 | evenCount++; 19 | } else { 20 | odd[oddCount] = num[i]; 21 | oddCount++; 22 | } 23 | } 24 | 25 | printf("Even numbers: "); 26 | for (i = 0; i < evenCount; i++) { 27 | printf("%d ", even[i]); 28 | } 29 | 30 | printf("\nOdd numbers: "); 31 | for (i = 0; i < oddCount; i++) { 32 | printf("%d ", odd[i]); 33 | } 34 | 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /Array/010 Find smallest element in an array without sorting.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, min; 5 | 6 | printf("Enter Array Size : "); 7 | scanf("%d", &size); 8 | 9 | printf("Enter the elements : "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &num[i]); 12 | } 13 | 14 | min = num[0]; 15 | 16 | for (i = 1; i < size; i++) { 17 | if (num[i] < min) { 18 | min = num[i]; 19 | } 20 | } 21 | 22 | printf("Smallest element in the array is : %d", min); 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Array/011 Reverse an array without using an additional array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int num[20], size, i, temp; 5 | printf("Enter Array Size : "); 6 | scanf("%d", &size); 7 | printf("Enter the elements : "); 8 | for (i = 0; i < size; i++) { 9 | scanf("%d", &num[i]); 10 | } 11 | // Reverse the array 12 | for (i = 0; i < size / 2; i++) { 13 | temp = num[i]; 14 | num[i] = num[size - 1 - i]; 15 | num[size - 1 - i] = temp; 16 | } 17 | // Print the reversed array 18 | printf("Reversed array: "); 19 | for (i = 0; i < size; i++) { 20 | printf("%d ", num[i]); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Array/012 Insert New value in an unsorted array at a specific position.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int arr[20], size, i, pos, newValue; 4 | printf("Enter Array Size : "); 5 | scanf("%d", &size); 6 | printf("Enter the elements : "); 7 | for (i = 0; i < size; i++) { 8 | scanf("%d", &arr[i]); 9 | } 10 | printf("Enter the position to insert new value : "); 11 | scanf("%d", &pos); 12 | printf("Enter the new value : "); 13 | scanf("%d", &newValue); 14 | // Shift elements to make space for the new value 15 | for (i = size; i > pos; i--) { 16 | arr[i] = arr[i - 1]; 17 | } 18 | // Insert the new value at the specified position 19 | arr[pos] = newValue; 20 | // Print the updated array 21 | printf("Array after insertion: "); 22 | for (i = 0; i <= size; i++) { 23 | printf("%d ", arr[i]); 24 | } 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /Array/013 Sort elements of array in ascending order.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int arr[20], size, i, j, temp; 4 | printf("Enter Array Size : "); 5 | scanf("%d", &size); 6 | printf("Enter the elements : "); 7 | for (i = 0; i < size; i++) { 8 | scanf("%d", &arr[i]); 9 | } 10 | // Sort the array in ascending order 11 | for (i = 0; i < size - 1; i++) { 12 | for (j = 0; j < size - 1 - i; j++) { 13 | if (arr[j] > arr[j + 1]) { 14 | // Swap elements if they are in the wrong order 15 | temp = arr[j]; 16 | arr[j] = arr[j + 1]; 17 | arr[j + 1] = temp; 18 | } 19 | } 20 | } 21 | // Print the sorted array 22 | printf("Array in ascending order: "); 23 | for (i = 0; i < size; i++) { 24 | printf("%d ", arr[i]); 25 | } 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Array/014 Sort elements of array in descending order.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int arr[20], size, i, j, temp; 4 | printf("Enter Array Size : "); 5 | scanf("%d", &size); 6 | printf("Enter the elements : "); 7 | for (i = 0; i < size; i++) { 8 | scanf("%d", &arr[i]); 9 | } 10 | // Sort the array in descending order 11 | for (i = 0; i < size - 1; i++) { 12 | for (j = 0; j < size - 1 - i; j++) { 13 | if (arr[j] < arr[j + 1]) { 14 | // Swap elements if they are in the wrong order 15 | temp = arr[j]; 16 | arr[j] = arr[j + 1]; 17 | arr[j + 1] = temp; 18 | } 19 | } 20 | } 21 | // Print the sorted array 22 | printf("Array in descending order: "); 23 | for (i = 0; i < size; i++) { 24 | printf("%d ", arr[i]); 25 | } 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Array/015 Insert New value in a sorted array.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int arr[20], size, i, newValue; 4 | printf("Enter Array Size : "); 5 | scanf("%d", &size); 6 | printf("Enter the elements (in ascending order) : "); 7 | for (i = 0; i < size; i++) { 8 | scanf("%d", &arr[i]); 9 | } 10 | printf("Enter the new value : "); 11 | scanf("%d", &newValue); 12 | // Find the position to insert the new value 13 | for (i = 0; i < size; i++) { 14 | if (arr[i] > newValue) { 15 | break; 16 | } 17 | } 18 | // Shift elements to make space for the new value 19 | for (int j = size; j > i; j--) { 20 | arr[j] = arr[j - 1]; 21 | } 22 | // Insert the new value at the specified position 23 | arr[i] = newValue; 24 | // Print the updated array 25 | printf("Array after insertion: "); 26 | for (i = 0; i <= size; i++) { 27 | printf("%d ", arr[i]); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /Array/016 Move all zeros to the beginning of an array without sorting.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[20], size, i, j, temp; 5 | 6 | // Input array size 7 | printf("Enter Array Size : "); 8 | scanf("%d", &size); 9 | 10 | // Input array elements 11 | printf("Enter the elements : "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Move zeros to the beginning 17 | j = size - 1; // Initialize index for non-zero elements 18 | for (i = size - 1; i >= 0; i--) { 19 | if (arr[i] != 0) { 20 | // If the element is non-zero, move it to the end 21 | arr[j--] = arr[i]; 22 | } 23 | } 24 | 25 | // Fill the remaining positions with zeros 26 | while (j >= 0) { 27 | arr[j--] = 0; 28 | } 29 | 30 | // Print the array after moving zeros to the beginning 31 | printf("Array after moving zeros to the beginning: "); 32 | for (i = 0; i < size; i++) { 33 | printf("%d ", arr[i]); 34 | } 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Array/017 Move all zeros to the end of an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[20], size, i, j, temp; 5 | 6 | // Input array size 7 | printf("Enter Array Size : "); 8 | scanf("%d", &size); 9 | 10 | // Input array elements 11 | printf("Enter the elements : "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Move zeros to the end 17 | j = 0; // Initialize index for non-zero elements 18 | for (i = 0; i < size; i++) { 19 | if (arr[i] != 0) { 20 | // If the element is non-zero, move it to the front 21 | arr[j++] = arr[i]; 22 | } 23 | } 24 | 25 | // Fill the remaining positions with zeros 26 | while (j < size) { 27 | arr[j++] = 0; 28 | } 29 | 30 | // Print the array after moving zeros to the end 31 | printf("Array after moving zeros to the end: "); 32 | for (i = 0; i < size; i++) { 33 | printf("%d ", arr[i]); 34 | } 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Array/018 Move all negative numbers to the beginning of an array without sorting.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[20], size, i, j, temp; 5 | 6 | // Input array size 7 | printf("Enter Array Size : "); 8 | scanf("%d", &size); 9 | 10 | // Input array elements 11 | printf("Enter the elements : "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Move negative numbers to the beginning without changing order 17 | j = 0; // Initialize index for negative numbers 18 | for (i = 0; i < size; i++) { 19 | if (arr[i] < 0) { 20 | // Shift elements to make space for the negative number 21 | temp = arr[i]; 22 | for (int k = i; k > j; k--) { 23 | arr[k] = arr[k - 1]; 24 | } 25 | arr[j] = temp; 26 | j++; 27 | } 28 | } 29 | 30 | // Print the array after moving negative numbers to the beginning 31 | printf("Array after moving negative numbers to the beginning: "); 32 | for (i = 0; i < size; i++) { 33 | printf("%d ", arr[i]); 34 | } 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Array/019 Merge two unsorted arrays in sorted order.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr1[20], arr2[20], mergedArr[40], size1, size2, sizeMerged, i, j, k; 5 | 6 | // Input size of the first array 7 | printf("Enter size of the first array : "); 8 | scanf("%d", &size1); 9 | 10 | // Input elements of the first array 11 | printf("Enter the elements of the first array : "); 12 | for (i = 0; i < size1; i++) { 13 | scanf("%d", &arr1[i]); 14 | } 15 | 16 | // Input size of the second array 17 | printf("Enter size of the second array : "); 18 | scanf("%d", &size2); 19 | 20 | // Input elements of the second array 21 | printf("Enter the elements of the second array : "); 22 | for (i = 0; i < size2; i++) { 23 | scanf("%d", &arr2[i]); 24 | } 25 | 26 | // Merge and sort the arrays 27 | sizeMerged = size1 + size2; 28 | i = j = k = 0; 29 | 30 | while (i < size1 && j < size2) { 31 | if (arr1[i] <= arr2[j]) { 32 | mergedArr[k++] = arr1[i++]; 33 | } else { 34 | mergedArr[k++] = arr2[j++]; 35 | } 36 | } 37 | 38 | while (i < size1) { 39 | mergedArr[k++] = arr1[i++]; 40 | } 41 | 42 | while (j < size2) { 43 | mergedArr[k++] = arr2[j++]; 44 | } 45 | 46 | // Print the merged and sorted array 47 | printf("Merged and sorted array : "); 48 | for (i = 0; i < sizeMerged; i++) { 49 | printf("%d ", mergedArr[i]); 50 | } 51 | 52 | return 0; 53 | } 54 | -------------------------------------------------------------------------------- /Array/020 Find second largest element in an array without sorting.c: -------------------------------------------------------------------------------- 1 | //Assume no elements repeating 2 | #include 3 | 4 | int main() { 5 | int arr[20], size, i; 6 | 7 | // Input size of the array 8 | printf("Enter size of the array : "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements of the array : "); 13 | for (i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | int firstMax, secondMax; 18 | 19 | // Initialize firstMax and secondMax based on the first two elements 20 | if (arr[0] > arr[1]) { 21 | firstMax = arr[0]; 22 | secondMax = arr[1]; 23 | } else { 24 | firstMax = arr[1]; 25 | secondMax = arr[0]; 26 | } 27 | 28 | // Traverse the array to find the second largest element 29 | for (i = 2; i < size; i++) { 30 | if (arr[i] > firstMax) { 31 | secondMax = firstMax; 32 | firstMax = arr[i]; 33 | } else if (arr[i] > secondMax) { 34 | secondMax = arr[i]; 35 | } 36 | } 37 | 38 | // Print the second largest element 39 | printf("The second largest element is: %d\n", secondMax); 40 | 41 | return 0; 42 | } 43 | -------------------------------------------------------------------------------- /Array/021 Find second smallest element in an array without sorting.c: -------------------------------------------------------------------------------- 1 | //Assume no elements repeating 2 | #include 3 | 4 | int main() { 5 | int arr[20], size, i; 6 | 7 | // Input size of the array 8 | printf("Enter size of the array : "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements of the array : "); 13 | for (i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | int firstMin, secondMin; 18 | 19 | // Initialize firstMin and secondMin based on the first two elements 20 | if (arr[0] < arr[1]) { 21 | firstMin = arr[0]; 22 | secondMin = arr[1]; 23 | } else { 24 | firstMin = arr[1]; 25 | secondMin = arr[0]; 26 | } 27 | 28 | // Traverse the array to find the second smallest element 29 | for (i = 2; i < size; i++) { 30 | if (arr[i] < firstMin) { 31 | secondMin = firstMin; 32 | firstMin = arr[i]; 33 | } else if (arr[i] < secondMin && arr[i] != firstMin) { 34 | secondMin = arr[i]; 35 | } 36 | } 37 | 38 | // Print the second smallest element 39 | printf("The second smallest element is: %d\n", secondMin); 40 | 41 | return 0; 42 | } 43 | -------------------------------------------------------------------------------- /Array/022 Count the frequency of each element of an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, count = 1, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Loop to find and print the frequency of each unique element 17 | for (i = 0; i < size; i++) { 18 | count = 0; // Reset count for each new element 19 | for (j = 0; j < size; j++) { 20 | // Check if the current element matches any other element 21 | if (arr[i] == arr[j]) { 22 | // If the current element is found at an earlier index, skip counting 23 | if (i > j) { 24 | count--; 25 | break; 26 | } 27 | count++; // Increment count for each occurrence of the element 28 | } 29 | } 30 | // Print the frequency of each unique element 31 | if (count > 1) { 32 | printf("\nFrequency of %d is %d.", arr[i], count); 33 | } 34 | } 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Array/023 Print all unique elements in an array.c: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | int main() { 5 | int arr[100], i, j, count, size; 6 | 7 | // Input size of the array 8 | printf("Enter the size of the array: "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements: "); 13 | for (i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | // Loop to find and print unique elements 18 | printf("Unique elements in the array: "); 19 | for (i = 0; i < size; i++) { 20 | count = 0; // Reset count for each new element 21 | for (j = 0; j < size; j++) { 22 | // Count occurrences of the current element 23 | if (arr[i] == arr[j]) { 24 | count++; 25 | } 26 | } 27 | // Print the element if it occurs exactly once 28 | if (count == 1) { 29 | printf("%d ", arr[i]); 30 | } 31 | } 32 | 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Array/024 Print duplicate elements in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, count, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Loop to check for duplicate elements 17 | printf("Duplicate elements in the array: "); 18 | for (i = 0; i < size; i++) { 19 | count = 0; // Reset count for each new element 20 | for (j = 0; j < size; j++) { 21 | // Check if the current element matches any other element 22 | if (arr[i] == arr[j]) { 23 | // If the current element is found at an earlier index, skip counting 24 | if (i > j) { 25 | break; 26 | } 27 | count++; // Increment count for each occurrence of the element 28 | } 29 | } 30 | // Print the element if it occurs more than once (duplicate) 31 | if (count > 1) { 32 | printf("%d ", arr[i]); 33 | } 34 | } 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Array/025 Find most repeated number in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, count, maxCount, mostRepeated, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | maxCount = 0; // Initialize the maximum count 17 | mostRepeated = arr[0]; // Assume the first element is the most repeated initially 18 | 19 | // Loop to find the most repeated number 20 | for (i = 0; i < size; i++) { 21 | count = 1; // Reset count for each new element 22 | for (j = i + 1; j < size; j++) { 23 | // Check if the current element matches any other element 24 | if (arr[i] == arr[j]) { 25 | count++; // Increment count for each occurrence of the element 26 | } 27 | } 28 | // Update mostRepeated if a new most repeated number is found 29 | if (count > maxCount) { 30 | maxCount = count; 31 | mostRepeated = arr[i]; 32 | } 33 | } 34 | 35 | // Print the most repeated number and its count 36 | printf("Most repeated number: %d (Count: %d)\n", mostRepeated, maxCount); 37 | 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /Array/026 Find array elements that occur 2 times in the array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, count, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | printf("Elements that occur exactly two times in the array: "); 17 | // Loop to find elements occurring exactly two times 18 | for (i = 0; i < size; i++) { 19 | count = 0; // Reset count for each new element 20 | // Check if the current element matches any other element 21 | for (j = 0; j < size; j++) { 22 | if (arr[i]==arr[j]) { 23 | // If the current element is found at an earlier index, skip counting 24 | if (i > j) { 25 | count--; 26 | break; 27 | } 28 | count++; // Increment count for each occurrence of the element 29 | } 30 | } 31 | // Print the element if it occurs exactly two times 32 | if (count == 2) { 33 | printf("%d ", arr[i]); 34 | } 35 | } 36 | 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /Array/027 Find prime numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | int arr[100], i, j, size, flag; 6 | 7 | // Input size of the array 8 | printf("Enter the size of the array: "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements: "); 13 | for (i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | printf("Prime numbers in the array: "); 18 | // Loop to find prime numbers 19 | for (i = 0; i < size; i++) { 20 | flag = 0; // Reset flag for each new number 21 | if (arr[i] == 1) { 22 | flag = 1; // 1 is not prime, set flag and skip to the next iteration 23 | continue; 24 | } 25 | 26 | // Loop to check for prime numbers 27 | for (j = 2; j <= arr[i] / 2; j++) { 28 | if (arr[i] % j == 0) { 29 | flag = 1; // Set flag if the number is divisible by any other number 30 | break; 31 | } 32 | } 33 | 34 | // If flag remains 0, the number is prime and is printed 35 | if (flag == 0) { 36 | printf("%d ", arr[i]); 37 | } 38 | } 39 | 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /Array/028 Find non-prime numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | int arr[100], i, j, size, flag; 6 | 7 | // Input size of the array 8 | printf("Enter the size of the array: "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements: "); 13 | for (i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | printf("Non-prime numbers in the array: "); 18 | // Loop to find non-prime numbers 19 | for (i = 0; i < size; i++) { 20 | if (arr[i] == 1) { 21 | printf("%d ", arr[i]); // 1 is not prime 22 | continue; // Skip prime checking when the number is 1 23 | } 24 | 25 | // Loop to check for prime numbers 26 | flag = 0; // Reset flag for each new number 27 | for (j = 2; j <= arr[i] / 2; j++) { 28 | if (arr[i] % j == 0) { 29 | flag = 1; // Set flag if the number is divisible by any other number 30 | break; 31 | } 32 | } 33 | 34 | // If flag is 1, the number is non-prime and is printed 35 | if (flag == 1) { 36 | printf("%d ", arr[i]); 37 | } 38 | } 39 | 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /Array/029 Remove all the odd numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Remove odd numbers 17 | for (i = 0; i < size; i++) { 18 | if (arr[i] % 2 == 1) { 19 | for (j = i; j < size - 1; j++) { 20 | arr[j] = arr[j + 1]; 21 | } 22 | size = size - 1; 23 | i--; // To recheck the current index after shifting 24 | } 25 | } 26 | 27 | printf("Array after removing odd numbers: "); 28 | for (i = 0; i < size; i++) { 29 | printf("%d ", arr[i]); 30 | } 31 | 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /Array/030 Remove all the even numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size; 5 | // Input size of the array 6 | printf("Enter the size of the array: "); 7 | scanf("%d", &size); 8 | // Input elements of the array 9 | printf("Enter the elements: "); 10 | for (i = 0; i < size; i++) { 11 | scanf("%d", &arr[i]); 12 | } 13 | // Remove even numbers 14 | for (i = 0; i < size; i++) { 15 | if (arr[i] % 2 == 0) { 16 | for (j = i; j 2 | 3 | int main() { 4 | int arr[100], i, j, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Remove prime numbers 17 | for (i = 0; i < size; i++) { 18 | if (arr[i] < 2) { 19 | flag = 1; // 0 and 1 are not prime 20 | } else { 21 | flag = 0; 22 | for (j = 2; j <= arr[i]/2; j++) { 23 | if (arr[i] % j == 0) { 24 | flag = 1; // It is not a prime number 25 | break; 26 | } 27 | } 28 | } 29 | 30 | if (flag == 0) { 31 | for (j = i; j < size - 1; j++) { 32 | arr[j] = arr[j + 1]; 33 | } 34 | size = size - 1; 35 | i--; // To recheck the current index after shifting 36 | } 37 | } 38 | 39 | printf("Array after removing prime numbers: "); 40 | for (i = 0; i < size; i++) { 41 | printf("%d ", arr[i]); 42 | } 43 | 44 | return 0; 45 | } 46 | -------------------------------------------------------------------------------- /Array/032 Find non-prime numbers in an array and insert their double after the same.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find non-prime numbers and insert their double after the same element 17 | for (i = 0; i < size; i++) { 18 | flag = 1; // Assume the number is prime 19 | 20 | // Special case for 1, as it is not a prime number 21 | if (arr[i] == 1) { 22 | flag = 0; 23 | } 24 | 25 | // Check if the number is prime or not 26 | for (int j = 2; j <= arr[i] / 2; j++) { 27 | if (arr[i] % j == 0) { 28 | flag = 0; // The number is not prime 29 | break; 30 | } 31 | } 32 | 33 | // If the number is not prime, insert double after the same element 34 | if (flag == 0) { 35 | // Shift all elements to the right starting from the end 36 | for (int k = size; k > i; k--) { 37 | arr[k] = arr[k - 1]; 38 | } 39 | 40 | arr[i + 1] = arr[i] * 2; // Insert double after non-prime element 41 | size++; // Increment the size of the array 42 | i++; // Skip the next element as it has been shifted 43 | } 44 | } 45 | 46 | // Print the modified array 47 | printf("Array after inserting double after non-prime numbers: "); 48 | for (i = 0; i < size; i++) { 49 | printf("%d ", arr[i]); 50 | } 51 | 52 | return 0; 53 | } 54 | -------------------------------------------------------------------------------- /Array/033 Replace prime numbers by their index position.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Replace prime numbers with their index positions 17 | for (i = 0; i < size; i++) { 18 | flag = 1; // Assume the number is prime 19 | 20 | // Special case for 1, as it is not a prime number 21 | if (arr[i] == 1) { 22 | flag = 0; 23 | } 24 | 25 | // Check if the number is prime or not 26 | for (int j = 2; j <= arr[i] / 2; j++) { 27 | if (arr[i] % j == 0) { 28 | flag = 0; // The number is not prime 29 | break; 30 | } 31 | } 32 | 33 | // If the number is prime, replace it with its index position 34 | if (flag == 1) { 35 | arr[i] = i; 36 | } 37 | } 38 | 39 | // Print the modified array 40 | printf("Array after replacing prime numbers with their index positions: "); 41 | for (i = 0; i < size; i++) { 42 | printf("%d ", arr[i]); 43 | } 44 | 45 | return 0; 46 | } 47 | -------------------------------------------------------------------------------- /Array/034 Remove all the duplicate elements in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Remove duplicate elements 17 | for (i = 0; i < size; i++) { 18 | for (j = i + 1; j < size;) { 19 | if (arr[i] == arr[j]) { 20 | // If duplicate found, shift elements to the left 21 | for (int k = j; k < size - 1; k++) { 22 | arr[k] = arr[k + 1]; 23 | } 24 | size--; // Decrease the size of the array 25 | } else { 26 | j++; // Move to the next element 27 | } 28 | } 29 | } 30 | 31 | // Print the array after removing duplicates 32 | printf("Array after removing duplicate elements: "); 33 | for (i = 0; i < size; i++) { 34 | printf("%d ", arr[i]); 35 | } 36 | 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /Array/035 Remove all the prime numbers > 50 and remove all the non-prime numbers.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Remove prime numbers > 50 and non-prime numbers 17 | for (i = 0; i < size; i++) { 18 | flag = 1; 19 | if (arr[i] == 1) { 20 | flag = 0; 21 | } 22 | for (j = 2; j <= arr[i] / 2; j++) { 23 | if (arr[i] % j == 0) { 24 | flag = 0; // It is not a prime number 25 | break; 26 | } 27 | } 28 | if (flag == 0 || (flag == 1 && arr[i] > 50 ) ) { 29 | // Shift elements to the left starting from the current position 30 | for (int k = i; k < size - 1; k++) { 31 | arr[k] = arr[k + 1]; 32 | } 33 | size--; // Decrease the size of the array 34 | i--; // Recheck the current index after shifting 35 | } 36 | } 37 | 38 | // Print the array after removing prime numbers > 50 and non-prime numbers 39 | printf("Array after removing prime numbers > 50 and non-prime numbers: "); 40 | for (i = 0; i < size; i++) { 41 | printf("%d ", arr[i]); 42 | } 43 | 44 | return 0; 45 | } 46 | -------------------------------------------------------------------------------- /Array/036 Find unique non-prime numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size, flag, isUnique; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find unique non-prime numbers 17 | printf("Unique non-prime numbers in the array : "); 18 | for (i = 0; i < size; i++) { 19 | flag = 1; 20 | if (arr[i] == 1) { 21 | flag = 0; // 1 is not a prime number 22 | } 23 | for (j = 2; j <= arr[i] / 2; j++) { 24 | if (arr[i] % j == 0) { 25 | flag = 0; // It is not a prime number 26 | break; 27 | } 28 | } 29 | 30 | // Print the number if it is unique and non-prime 31 | if (flag == 0) { 32 | // Check if the number is unique 33 | isUnique = 1; 34 | for (int k = 0; k < size; k++) { 35 | if (i != k && arr[i] == arr[k]) { 36 | isUnique = 0; // Found a duplicate 37 | break; 38 | } 39 | } 40 | 41 | if (isUnique == 1) { 42 | printf("%d ", arr[i]); 43 | } 44 | } 45 | } 46 | 47 | return 0; 48 | } 49 | -------------------------------------------------------------------------------- /Array/037 Delete two elements after the occurrence of an even number.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find even number and delete two elements after its occurrence 17 | for (i = 0; i < size; i++) { 18 | if (arr[i] % 2 == 0) { 19 | // If the even number is at the last position, no need to delete 20 | if (i == size - 1) { 21 | size = size; 22 | } 23 | // If the even number is at the second-to-last position, delete one element 24 | else if (i == size - 2) { 25 | size = size - 1; 26 | } 27 | // If the even number is at any other position, delete two elements 28 | else { 29 | for (j = i; j < size; j++) { 30 | arr[j + 1] = arr[j + 3]; 31 | arr[j + 2] = arr[j + 4]; 32 | } 33 | size = size - 2; 34 | } 35 | } 36 | } 37 | 38 | // Print the array after deletion 39 | printf("Array after deleting two elements after the occurrence of an even number: "); 40 | for (i = 0; i < size; i++) { 41 | printf("%d ", arr[i]); 42 | } 43 | return 0; 44 | } 45 | -------------------------------------------------------------------------------- /Array/038 Delete two elements after the occurrence of a prime number.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find prime number and delete two elements after its occurrence 17 | for (i = 0; i < size; i++) { 18 | flag = 1; 19 | if (arr[i] == 1) { 20 | flag = 0; // 1 is not a prime number 21 | } else { 22 | for (j = 2; j <= arr[i] / 2; j++) { 23 | if (arr[i] % j == 0) { 24 | flag = 0; // It is not a prime number 25 | break; 26 | } 27 | } 28 | } 29 | 30 | if (flag == 1) { 31 | // If the prime number is at the last position, no need to delete 32 | if (i == size - 1) { 33 | size = size; 34 | } 35 | // If the prime number is at the second-to-last position, delete one element 36 | else if (i == size - 2) { 37 | size = size - 1; 38 | } 39 | // If the prime number is at any other position, delete two elements 40 | else { 41 | for (j = i; j < size; j++) { 42 | arr[j + 1] = arr[j + 3]; 43 | arr[j + 2] = arr[j + 4]; 44 | } 45 | size = size - 2; 46 | } 47 | } 48 | } 49 | 50 | // Print the array after deletion 51 | printf("Array after deleting two elements after the occurrence of a prime number: "); 52 | for (i = 0; i < size; i++) { 53 | printf("%d ", arr[i]); 54 | } 55 | 56 | return 0; 57 | } 58 | -------------------------------------------------------------------------------- /Array/039 Delete two elements after the occurrence of an odd number.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find odd number and delete two elements after its occurrence 17 | for (i = 0; i < size; i++) { 18 | if (arr[i] % 2 != 0) { 19 | // If the odd number is at the last position, no need to delete 20 | if (i == size - 1) { 21 | size = size; 22 | } 23 | // If the odd number is at the second-to-last position, delete one element 24 | else if (i == size - 2) { 25 | size = size - 1; 26 | } 27 | // If the odd number is at any other position, delete two elements 28 | else { 29 | for (j = i; j < size; j++) { 30 | arr[j + 1] = arr[j + 3]; 31 | arr[j + 2] = arr[j + 4]; 32 | } 33 | size = size - 2; 34 | } 35 | } 36 | } 37 | 38 | // Print the array after deletion 39 | printf("Array after deleting two elements after the occurrence of an odd number: "); 40 | for (i = 0; i < size; i++) { 41 | printf("%d ", arr[i]); 42 | } 43 | 44 | return 0; 45 | } 46 | -------------------------------------------------------------------------------- /Array/040 Delete three elements after the occurrence of a prime number.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, flag, i, j; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | for (i = 0; i < size; i++) { 17 | flag = 0; 18 | 19 | // Skip 1 as it is not a prime number 20 | if (arr[i] == 1) { 21 | flag = 1; 22 | } 23 | 24 | for (j = 2; j < arr[i]; j++) { 25 | if (arr[i] % j == 0) { 26 | flag = 1; 27 | break; 28 | } 29 | } 30 | 31 | if (flag == 0) { 32 | if (i == size - 1) { 33 | size = size; 34 | } else if (i == size - 2) { 35 | size = size - 1; 36 | } else if (i == size - 3) { 37 | size = size - 2; 38 | } else { 39 | for (j = i; j < size-3; j++) { 40 | arr[j+1] = arr[j + 4]; 41 | } 42 | size = size - 3; 43 | } 44 | } 45 | } 46 | 47 | printf("Array after deleting three elements after the occurrence of a prime number: "); 48 | for (i = 0; i < size; i++) { 49 | printf("%d ", arr[i]); 50 | } 51 | 52 | return 0; 53 | } 54 | -------------------------------------------------------------------------------- /Array/041 Find third largest number in an array.c: -------------------------------------------------------------------------------- 1 | // Assuming all elements are unique 2 | #include 3 | 4 | int main() { 5 | int arr[100], size; 6 | 7 | // Input size of the array 8 | printf("Enter the size of the array: "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements: "); 13 | for (int i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | // Initialize variables to store first, second, and third largest numbers 18 | int firstMax, secondMax, thirdMax; 19 | 20 | // Find first, second, and third maximum values from the first three elements 21 | if (arr[0] > arr[1]) { 22 | if (arr[0] > arr[2]) { 23 | firstMax = arr[0]; 24 | if (arr[1] > arr[2]) { 25 | secondMax = arr[1]; 26 | thirdMax = arr[2]; 27 | } else { 28 | secondMax = arr[2]; 29 | thirdMax = arr[1]; 30 | } 31 | } else { 32 | firstMax = arr[2]; 33 | secondMax = arr[0]; 34 | thirdMax = arr[1]; 35 | } 36 | } else { 37 | if (arr[1] > arr[2]) { 38 | firstMax = arr[1]; 39 | if (arr[0] > arr[2]) { 40 | secondMax = arr[0]; 41 | thirdMax = arr[2]; 42 | } else { 43 | secondMax = arr[2]; 44 | thirdMax = arr[0]; 45 | } 46 | } else { 47 | firstMax = arr[2]; 48 | secondMax = arr[1]; 49 | thirdMax = arr[0]; 50 | } 51 | } 52 | 53 | // Find the third maximum value from index 3 onwards 54 | for (int i = 3; i < size; i++) { 55 | if (arr[i] > firstMax) { 56 | thirdMax = secondMax; 57 | secondMax = firstMax; 58 | firstMax = arr[i]; 59 | } else if (arr[i] > secondMax) { 60 | thirdMax = secondMax; 61 | secondMax = arr[i]; 62 | } else if (arr[i] > thirdMax) { 63 | thirdMax = arr[i]; 64 | } 65 | } 66 | 67 | // Print the third largest number 68 | printf("The third largest number is: %d\n", thirdMax); 69 | 70 | return 0; 71 | } 72 | -------------------------------------------------------------------------------- /Array/042 Find third smallest number in an array.c: -------------------------------------------------------------------------------- 1 | // Assuming all elements are unique 2 | #include 3 | 4 | int main() { 5 | int arr[100], size; 6 | 7 | // Input size of the array 8 | printf("Enter the size of the array: "); 9 | scanf("%d", &size); 10 | 11 | // Input elements of the array 12 | printf("Enter the elements: "); 13 | for (int i = 0; i < size; i++) { 14 | scanf("%d", &arr[i]); 15 | } 16 | 17 | // Initialize variables to store first, second, and third smallest numbers 18 | int firstMin, secondMin, thirdMin; 19 | 20 | // Find first, second, and third minimum values from the first three elements 21 | if (arr[0] < arr[1]) { 22 | if (arr[0] < arr[2]) { 23 | firstMin = arr[0]; 24 | if (arr[1] < arr[2]) { 25 | secondMin = arr[1]; 26 | thirdMin = arr[2]; 27 | } else { 28 | secondMin = arr[2]; 29 | thirdMin = arr[1]; 30 | } 31 | } else { 32 | firstMin = arr[2]; 33 | secondMin = arr[0]; 34 | thirdMin = arr[1]; 35 | } 36 | } else { 37 | if (arr[1] < arr[2]) { 38 | firstMin = arr[1]; 39 | if (arr[0] < arr[2]) { 40 | secondMin = arr[0]; 41 | thirdMin = arr[2]; 42 | } else { 43 | secondMin = arr[2]; 44 | thirdMin = arr[0]; 45 | } 46 | } else { 47 | firstMin = arr[2]; 48 | secondMin = arr[1]; 49 | thirdMin = arr[0]; 50 | } 51 | } 52 | 53 | // Find the third smallest value from index 3 onwards 54 | for (int i = 3; i < size; i++) { 55 | if (arr[i] < firstMin) { 56 | thirdMin = secondMin; 57 | secondMin = firstMin; 58 | firstMin = arr[i]; 59 | } else if (arr[i] < secondMin) { 60 | thirdMin = secondMin; 61 | secondMin = arr[i]; 62 | } else if (arr[i] < thirdMin) { 63 | thirdMin = arr[i]; 64 | } 65 | } 66 | 67 | // Print the third smallest number 68 | printf("The third smallest number is: %d\n", thirdMin); 69 | 70 | return 0; 71 | } 72 | -------------------------------------------------------------------------------- /Array/043 Find Average of Prime and non prime numbers in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size; 5 | int sumPrime = 0, countPrime = 0; 6 | int sumNonPrime = 0, countNonPrime = 0; 7 | 8 | // Input size of the array 9 | printf("Enter the size of the array: "); 10 | scanf("%d", &size); 11 | 12 | // Input elements of the array 13 | printf("Enter the elements: "); 14 | for (int i = 0; i < size; i++) { 15 | scanf("%d", &arr[i]); 16 | } 17 | 18 | // Calculate sum and count of prime and non-prime numbers 19 | for (int i = 0; i < size; i++) { 20 | int num = arr[i]; 21 | int isPrime = 1; // Assume the number is prime 22 | 23 | // Check if the number is prime 24 | if (num <= 1) { 25 | isPrime = 0; // Numbers less than or equal to 1 are not prime 26 | } else { 27 | for (int j = 2; j * j <= num; j++) { 28 | if (num % j == 0) { 29 | isPrime = 0; // Number is not prime 30 | break; 31 | } 32 | } 33 | } 34 | 35 | // Update sum and count based on prime or non-prime 36 | if (isPrime) { 37 | sumPrime += num; 38 | countPrime++; 39 | } else { 40 | sumNonPrime += num; 41 | countNonPrime++; 42 | } 43 | } 44 | 45 | // Calculate average of prime and non-prime numbers 46 | float avgPrime = countPrime > 0 ? (float)sumPrime / countPrime : 0; 47 | float avgNonPrime = countNonPrime > 0 ? (float)sumNonPrime / countNonPrime : 0; 48 | 49 | // Print the averages 50 | printf("Average of prime numbers: %.2f\n", avgPrime); 51 | printf("Average of non-prime numbers: %.2f\n", avgNonPrime); 52 | 53 | return 0; 54 | } 55 | -------------------------------------------------------------------------------- /Array/044 Find the maximum and minimum element in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (int i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Initialize max and min with first element of the array 17 | int max = arr[0]; 18 | int min = arr[0]; 19 | 20 | // Find maximum and minimum elements 21 | for (int i = 1; i < size; i++) { 22 | if (arr[i] > max) { 23 | max = arr[i]; 24 | } 25 | if (arr[i] < min) { 26 | min = arr[i]; 27 | } 28 | } 29 | 30 | // Print the maximum and minimum elements 31 | printf("Maximum element: %d\n", max); 32 | printf("Minimum element: %d\n", min); 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Array/045 C program to replace all prime numbers by 0 & even numbers by 1 in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], i, j, size, flag; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Loop to replace prime numbers by 0 and even numbers by 1 17 | for (i = 0; i < size; i++) { 18 | flag = 0; 19 | 20 | // Check if the number is prime 21 | if (arr[i] == 1) { 22 | flag = 1; // 1 is not a prime number 23 | } 24 | 25 | for (j = 2; j <= arr[i] / 2; j++) { 26 | if (arr[i] % j == 0) { 27 | flag = 1; // Not prime 28 | break; 29 | } 30 | } 31 | 32 | if (flag == 0) { 33 | // Replace prime numbers with 0 34 | arr[i] = 0; 35 | } else if (arr[i] % 2 == 0) { 36 | // Replace even numbers with 1 37 | arr[i] = 1; 38 | } 39 | } 40 | 41 | // Output the modified array 42 | printf("Modified array: "); 43 | for (i = 0; i < size; i++) { 44 | printf("%d ", arr[i]); 45 | } 46 | 47 | return 0; 48 | } 49 | -------------------------------------------------------------------------------- /Array/046 Remove odd numbers and find sum of the existing values in the array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, i, j, sum = 0; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Loop to remove odd numbers and calculate the sum of even numbers 17 | for (i = 0; i < size; i++) { 18 | if (arr[i] % 2 != 0) { 19 | // If the number is odd, shift the elements to the left 20 | for (j = i; j < size - 1; j++) { 21 | arr[j] = arr[j + 1]; 22 | } 23 | size--; // Reduce the array size 24 | i--; // Stay at the same index to check the shifted element 25 | } 26 | } 27 | 28 | // Calculate the sum of the remaining (even) numbers 29 | for (i = 0; i < size; i++) { 30 | sum += arr[i]; 31 | } 32 | 33 | // Output the modified array and sum 34 | printf("Modified array (even numbers only): "); 35 | for (i = 0; i < size; i++) { 36 | printf("%d ", arr[i]); 37 | } 38 | 39 | printf("\nSum of the even numbers: %d\n", sum); 40 | 41 | return 0; 42 | } 43 | -------------------------------------------------------------------------------- /Array/047 Find the average of all unique array elements.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, i, j, count, sum = 0, uniqueCount = 0, isUnique; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | printf("Unique elements: "); 17 | // Loop to find unique elements and calculate their sum 18 | for (i = 0; i < size; i++) { 19 | isUnique = 1; // Assume the current element is unique 20 | for (j = 0; j < size; j++) { 21 | if (arr[i] == arr[j] && i != j) { 22 | isUnique = 0; // If a duplicate is found, mark it as not unique 23 | break; 24 | } 25 | } 26 | 27 | // If the element is unique, print it and add to sum and count it 28 | if (isUnique) { 29 | printf("%d ", arr[i]); 30 | sum += arr[i]; 31 | uniqueCount++; 32 | } 33 | } 34 | 35 | // Calculate and print the average of unique elements 36 | if (uniqueCount > 0) { 37 | float average = (float)sum / uniqueCount; 38 | printf("\nAverage of unique elements: %.2f\n", average); 39 | } else { 40 | printf("\nNo unique elements found.\n"); 41 | } 42 | 43 | return 0; 44 | } 45 | -------------------------------------------------------------------------------- /Array/048 Delete an element from an array at specified position.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, pos, i; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements of the array: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Input the position of the element to delete 17 | printf("Enter the position of the element to delete: "); 18 | scanf("%d", &pos); 19 | 20 | // Check if the position is valid 21 | if (pos < 1 || pos > size) { 22 | printf("Invalid position!\n"); 23 | } else { 24 | // Shift elements to the left to overwrite the element at 'pos' 25 | for (i = pos - 1; i < size - 1; i++) { 26 | arr[i] = arr[i + 1]; 27 | } 28 | 29 | // Reduce array size by 1 30 | size--; 31 | 32 | // Print the array after deletion 33 | printf("Array after deletion: "); 34 | for (i = 0; i < size; i++) { 35 | printf("%d ", arr[i]); 36 | } 37 | printf("\n"); 38 | } 39 | 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /Array/049 Find factorial of largest number in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, i, max, fact = 1; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find the maximum element in the array 17 | max = arr[0]; 18 | for (i = 1; i < size; i++) { 19 | if (arr[i] > max) { 20 | max = arr[i]; 21 | } 22 | } 23 | 24 | // Calculate the factorial of the maximum element 25 | // 'fact' is set to 1 because the factorial starts by multiplying from 1 upwards 26 | for (i = 1; i <= max; i++) { 27 | fact *= i; 28 | } 29 | 30 | // Print the maximum element and its factorial 31 | printf("The largest number is: %d\n", max); 32 | printf("The factorial of %d is: %d\n", max, fact); 33 | 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Array/050 If array sum is greater than 100 delete odd, if sum is less than 100 delete even numbers.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, sum = 0, i, j; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | sum += arr[i]; // Calculate the sum 15 | } 16 | 17 | // Print the sum 18 | printf("The sum of the array elements is: %d\n", sum); 19 | 20 | // Based on the sum, either delete odd or even numbers 21 | if (sum > 100) { 22 | // Delete odd numbers 23 | printf("Sum is greater than 100, deleting odd numbers...\n"); 24 | for (i = 0; i < size; i++) { 25 | if (arr[i] % 2 != 0) { // If the element is odd 26 | // Shift the elements to delete the odd number 27 | for (j = i; j < size - 1; j++) { 28 | arr[j] = arr[j + 1]; 29 | } 30 | size--; // Decrease the size of the array 31 | i--; // Recheck the current index after deletion 32 | } 33 | } 34 | } else { 35 | // Delete even numbers 36 | printf("Sum is less than or equal to 100, deleting even numbers...\n"); 37 | for (i = 0; i < size; i++) { 38 | if (arr[i] % 2 == 0) { // If the element is even 39 | // Shift the elements to delete the even number 40 | for (j = i; j < size - 1; j++) { 41 | arr[j] = arr[j + 1]; 42 | } 43 | size--; // Decrease the size of the array 44 | i--; // Recheck the current index after deletion 45 | } 46 | } 47 | } 48 | 49 | // Print the modified array 50 | printf("Modified array: "); 51 | for (i = 0; i < size; i++) { 52 | printf("%d ", arr[i]); 53 | } 54 | 55 | return 0; 56 | } 57 | -------------------------------------------------------------------------------- /Array/051 Delete smallest element in an array.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int arr[100], size, i, j, minIndex, minValue; 5 | 6 | // Input size of the array 7 | printf("Enter the size of the array: "); 8 | scanf("%d", &size); 9 | 10 | // Input elements of the array 11 | printf("Enter the elements: "); 12 | for (i = 0; i < size; i++) { 13 | scanf("%d", &arr[i]); 14 | } 15 | 16 | // Find the minimum element and its index 17 | minIndex = 0; 18 | minValue = arr[0]; 19 | for (i = 1; i < size; i++) { 20 | if (arr[i] < minValue) { 21 | minValue = arr[i]; 22 | minIndex = i; 23 | } 24 | } 25 | 26 | // Print the minimum element 27 | printf("The lowest element in the array is: %d\n", minValue); 28 | 29 | // Delete the minimum element by shifting elements 30 | for (i = minIndex; i < size - 1; i++) { 31 | arr[i] = arr[i + 1]; 32 | } 33 | size--; // Decrease the size of the array 34 | 35 | // Print the modified array 36 | printf("Array after deleting the lowest element: "); 37 | for (i = 0; i < size; i++) { 38 | printf("%d ", arr[i]); 39 | } 40 | 41 | return 0; 42 | } 43 | -------------------------------------------------------------------------------- /Array/052 find the majority element in the array.c: -------------------------------------------------------------------------------- 1 | //The majority element is the element that appears more than ⌊n / 2⌋ times 2 | 3 | #include 4 | 5 | int main() { 6 | int arr[100], size, i, j; 7 | int maxCount = 0, majorityElement = -1; 8 | 9 | // Input size of the array 10 | printf("Enter the size of the array: "); 11 | scanf("%d", &size); 12 | 13 | // Input elements of the array 14 | printf("Enter the elements: "); 15 | for (i = 0; i < size; i++) { 16 | scanf("%d", &arr[i]); 17 | } 18 | 19 | // Find the majority element 20 | for (i = 0; i < size; i++) { 21 | int count = 0; 22 | for (j = 0; j < size; j++) { 23 | if (arr[j] == arr[i]) { 24 | count++; 25 | } 26 | } 27 | if (count > size / 2) { 28 | majorityElement = arr[i]; 29 | break; 30 | } 31 | } 32 | 33 | // Print the result 34 | if (majorityElement != -1) { 35 | printf("The majority element is: %d\n", majorityElement); 36 | } else { 37 | printf("There is no majority element.\n"); 38 | } 39 | 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Pattern/01 : Introduction to C Programming Patterns.c: -------------------------------------------------------------------------------- 1 | // Concept of patterns in programming 2 | // Importance of patterns, their applications, and how they can enhance problem-solving skills. 3 | // Pre-requisites : Basic C Programming, Data types, If else conditions, For loop, etc 4 | // 100k coding challenge (5 parts) / 3 Hour Coding full 5 | // Patterns help us solve complex problems by breaking them down into smaller, more manageable components. 6 | // They provide structure, organization, and efficiency to our code. By learning patterns, you'll develop problem-solving skills that are essential for any programmer. 7 | // To follow along with this series, you'll need a C development environment. There are various options available, such as IDEs (Integrated Development Environments) like Code::Blocks, Dev-C++, or text editors like Notepad++ or Visual Studio Code. Choose the one that suits your preferences and set it up on your machine. 8 | // I choose online gdb 9 | // Simple patterns 1, 2, 3, … & 1, 3, 5, 7, … 10 | // H/W 1, 5, 9, … 11 | // 100, 99, 98, … 1 & 99, 95, 91, … 2 12 | // Print multiplication table of a number i/p from user 13 | // H/W : Learn 2D matrix and concepts of rows and columns & Nested for loops 14 | 15 | // https://www.geeksforgeeks.org/pattern-programs-in-c/ 16 | // https://www.javatpoint.com/star-program-in-c 17 | -------------------------------------------------------------------------------- /Pattern/02 : Simple Patterns.c: -------------------------------------------------------------------------------- 1 | Video 2: Simple Patterns 2 | 3 | Code in VS Code and stop execution by line by line for understanding 4 | Concept of rows and Columns 5 | Explain 2D matrix 6 | 7 | Square Star pattern 8 | * * * * 9 | * * * * 10 | * * * * 11 | * * * * 12 | 13 | // Increasing Pattern 14 | * 15 | * * 16 | * * * 17 | * * * * 18 | * * * * * 19 | 20 | #include 21 | int main() { 22 | int rows; 23 | printf("Enter Number of rows : "); 24 | scanf("%d", &rows); 25 | 26 | for (int i = 1; i <= rows; i++) { 27 | for (int j = 1; j <= i; j++) { 28 | printf("* "); 29 | } 30 | printf("\n"); 31 | } 32 | return 0; 33 | } 34 | 35 | // Increasing by double 36 | * * 37 | * * * * 38 | * * * * * * 39 | * * * * * * * * 40 | 41 | #include 42 | int main() { 43 | int rows; 44 | printf("Enter Number of rows : "); 45 | scanf("%d", &rows); 46 | 47 | for (int i = 1; i <= rows; i++) { 48 | for (int j = 1; j <= 2 * i; j++) { 49 | printf("* "); 50 | } 51 | printf("\n"); 52 | } 53 | return 0; 54 | } 55 | 56 | 57 | H/W 1: Increase by triple (multiples of 3) 58 | 59 | Star Pattern decreasing 60 | 61 | Explain concepts of (- -) decrement operator, >= in condition etc (if <= used which lead to infinite loop) 62 | 63 | * * * * 64 | * * * 65 | * * 66 | * 67 | 68 | #include 69 | int main() { 70 | int rows; 71 | printf("Enter Number of rows : "); 72 | scanf("%d", &rows); 73 | 74 | for (int i = rows; i >= 1; i--) { 75 | for (int j = 1; j <= i; j++) { 76 | printf("* "); 77 | } 78 | printf("\n"); 79 | } 80 | return 0; 81 | } 82 | 83 | 84 | H/W 2: (Decrementing by 2) 85 | 86 | * * * * * * * * 87 | * * * * * * 88 | * * * * 89 | * * 90 | 91 | #include 92 | int main() { 93 | int rows; 94 | printf("Enter Number of rows : "); 95 | scanf("%d", &rows); 96 | 97 | for (int i = rows; i >= 1; i--) { 98 | for (int j = 1; j <= 2 * i; j++) { 99 | printf("* "); 100 | } 101 | printf("\n"); 102 | } 103 | return 0; 104 | } 105 | 106 | 107 | H/W 3 (Explain rows till center then another loop for decrementing) 108 | 109 | * 110 | * * 111 | * * * 112 | * * * * 113 | * * * * * 114 | * * * * 115 | * * * 116 | * * 117 | * 118 | 119 | #include 120 | int main() { 121 | int rows; 122 | printf("Enter Number of rows : "); 123 | scanf("%d", &rows); 124 | 125 | // Upper half of the pattern 126 | for (int i = 1; i <= rows; i++) { 127 | for (int j = 1; j <= i; j++) { 128 | printf("* "); 129 | } 130 | printf("\n"); 131 | } 132 | 133 | // Lower half of the pattern 134 | for (int i = rows - 1; i >= 1; i--) { 135 | for (int j = 1; j <= i; j++) { 136 | printf("* "); 137 | } 138 | printf("\n"); 139 | } 140 | 141 | return 0; 142 | } 143 | -------------------------------------------------------------------------------- /Pattern/03 : Basic Number patterns.c: -------------------------------------------------------------------------------- 1 | Video 3: Basic Number patterns 2 | Explain again concepts of row and columns 3 | 4 | Basic column number pattern 5 | 1 2 3 4 5 6 | 1 2 3 4 5 7 | 1 2 3 4 5 8 | 1 2 3 4 5 9 | 1 2 3 4 5 10 | 11 | #include 12 | int main() { 13 | int rows; 14 | printf("Enter number of rows: "); 15 | scanf("%d", &rows); 16 | 17 | for (int i = 1; i <= rows; i++) { 18 | for (int j = 1; j <= rows; j++) { 19 | printf("%d ", j); 20 | } 21 | printf("\n"); 22 | } 23 | 24 | return 0; 25 | } 26 | 27 | 28 | H/W 3: Row number pattern 29 | Explain row concept again 30 | 1 1 1 1 1 31 | 2 2 2 2 2 32 | 3 3 3 3 3 33 | 4 4 4 4 4 34 | 5 5 5 5 5 35 | 36 | #include 37 | int main() { 38 | int rows; 39 | printf("Enter number of rows: "); 40 | scanf("%d", &rows); 41 | 42 | for (int i = 1; i <= rows; i++) { 43 | for (int j = 1; j <= rows; j++) { 44 | printf("%d ", i); 45 | } 46 | printf("\n"); 47 | } 48 | 49 | return 0; 50 | } 51 | 52 | Pattern with incrementing numbers 53 | 1 54 | 1 2 55 | 1 2 3 56 | 1 2 3 4 57 | 1 2 3 4 5 58 | 59 | #include 60 | int main() { 61 | int rows; 62 | printf("Enter number of rows: "); 63 | scanf("%d", &rows); 64 | 65 | for (int i = 1; i <= rows; i++) { 66 | for (int j = 1; j <= i; j++) { 67 | printf("%d ", j); 68 | } 69 | printf("\n"); 70 | } 71 | 72 | return 0; 73 | } 74 | 75 | 76 | H/W 4: Pattern with incrementing rows and constant columns 77 | 1 78 | 2 2 79 | 3 3 3 80 | 4 4 4 4 81 | 5 5 5 5 5 82 | 83 | #include 84 | int main() { 85 | int rows; 86 | printf("Enter number of rows: "); 87 | scanf("%d", &rows); 88 | 89 | for (int i = 1; i <= rows; i++) { 90 | for (int j = 1; j <= i; j++) { 91 | printf("%d ", i); 92 | } 93 | printf("\n"); 94 | } 95 | 96 | return 0; 97 | } 98 | 99 | 100 | 101 | Decreasing Number Pattern 102 | 5 103 | 4 5 104 | 3 4 5 105 | 2 3 4 5 106 | 1 2 3 4 5 107 | 108 | #include 109 | int main() { 110 | int rows; 111 | printf("Enter number of rows: "); 112 | scanf("%d", &rows); 113 | 114 | for (int i = rows; i >= 1; i--) { 115 | for (int j = rows; j >= i; j--) { 116 | printf("%d ", j); 117 | } 118 | printf("\n"); 119 | } 120 | 121 | return 0; 122 | } 123 | 124 | 125 | 126 | H/W 5: Decreasing row number pattern 127 | 5 128 | 5 4 129 | 5 4 3 130 | 5 4 3 2 131 | 5 4 3 2 1 132 | 133 | #include 134 | int main() { 135 | int rows; 136 | printf("Enter number of rows: "); 137 | scanf("%d", &rows); 138 | 139 | for (int i = 1; i <= rows; i++) { 140 | for (int j = rows; j >= i; j--) { 141 | printf("%d ", j); 142 | } 143 | printf("\n"); 144 | } 145 | 146 | return 0; 147 | } 148 | 149 | 150 | H/W 6: Pattern with incrementing rows and columns (left-aligned) 151 | 1 152 | 1 2 153 | 1 2 3 154 | 1 2 3 4 155 | 1 2 3 4 5 156 | 1 2 3 4 157 | 1 2 3 158 | 1 2 159 | 1 160 | 161 | #include 162 | int main() { 163 | int rows; 164 | printf("Enter number of rows: "); 165 | scanf("%d", &rows); 166 | 167 | for (int i = 1; i <= rows; i++) { 168 | for (int j = 1; j <= i; j++) { 169 | printf("%d ", j); 170 | } 171 | printf("\n"); 172 | } 173 | 174 | for (int i = rows - 1; i >= 1; i--) { 175 | for (int j = 1; j <= i; j++) { 176 | printf("%d ", j); 177 | } 178 | printf("\n"); 179 | } 180 | 181 | return 0; 182 | } 183 | 184 | 185 | 186 | -------------------------------------------------------------------------------- /Pattern/04 : Advanced Star & Number patterns.c: -------------------------------------------------------------------------------- 1 | Video 4: Star & Number patterns 2 | 3 | *1 - 1 (1-1)*2+1=1 4 | * * *3 -2 - (2-1)*2+1=3 5 | * * * * *5 - (3-1)*2+1= 5 6 | * * * * * * *7 7 | * * * * * * * * *9 8 | 9 | #include 10 | int main() { 11 | int rows; 12 | printf("Enter number of rows: "); 13 | scanf("%d", &rows); 14 | 15 | for (int i = 1; i <= rows; i++) { 16 | for (int j = 1; j <= (i*2-1); j++) { 17 | printf("* "); 18 | } 19 | printf("\n"); 20 | } 21 | 22 | return 0; 23 | } 24 | 25 | 26 | H/W 6 : 27 | 1 28 | 1 2 3 29 | 1 2 3 4 5 30 | 1 2 3 4 5 6 7 31 | 1 2 3 4 5 6 7 8 9 32 | 33 | #include 34 | int main() { 35 | int rows; 36 | printf("Enter number of rows: "); 37 | scanf("%d", &rows); 38 | 39 | for (int i = 1; i <= rows; i++) { 40 | for (int j = 1; j <= (i*2-1); j++) { 41 | printf("%d ",j); 42 | } 43 | printf("\n"); 44 | } 45 | 46 | return 0; 47 | } 48 | 49 | 50 | Controlling using extra variable 51 | 1 52 | 2 3 53 | 4 5 6 54 | 7 8 9 10 55 | 11 12 13 14 15 56 | 57 | #include 58 | int main() { 59 | int rows, num = 1; 60 | printf("Enter number of rows: "); 61 | scanf("%d", &rows); 62 | 63 | for (int i = 1; i <= rows; i++) { 64 | for (int j = 1; j <= i; j++) { 65 | // printf("%d ", num++); post increment 66 | printf("%d ", num); 67 | num++; // num = num + 1; 68 | } 69 | printf("\n"); 70 | } 71 | 72 | return 0; 73 | } 74 | 75 | 76 | 50 77 | 45 40 78 | 35 30 25 79 | 20 15 10 5 80 | 81 | #include 82 | int main() { 83 | int rows, num; 84 | printf("Enter number of rows: "); 85 | scanf("%d", &rows); 86 | num = rows * (rows+1) * 5 / 2; //num = 50; for 4 rows 87 | for (int i = 1; i <= rows; i++) { 88 | for (int j = 1; j <= i; j++) { 89 | printf("%d ", num); 90 | num -= 5; // num = num - 5; 91 | } 92 | printf("\n"); 93 | } 94 | 95 | return 0; 96 | } 97 | 98 | 99 | H/W 7 100 | 1 - 1 2 3 101 | 2 - 6 5 4 102 | 3 - 7 8 9 103 | 104 | 105 | H/W 8 106 | 1 107 | 3 2 108 | 4 5 6 109 | 11 10 8 7 110 | 111 | -------------------------------------------------------------------------------- /Pattern/05 : Alphabet Patterns.c: -------------------------------------------------------------------------------- 1 | 5: Alphabet Patterns 2 | Concepts ASCII 3 | a - 97 4 | A - 65 5 | 6 | A 7 | A B 8 | A B C 9 | A B C D 10 | A B C D E 11 | 12 | #include 13 | int main() { 14 | int rows; 15 | printf("Enter number of rows: "); 16 | scanf("%d", &rows); 17 | 18 | for (int i = 0; i < rows; i++) { 19 | char ch = 'A'; 20 | for (int j = 0; j <= i; j++) { 21 | printf("%c ", ch + j); 22 | } 23 | printf("\n"); 24 | } 25 | return 0; 26 | } 27 | 28 | 29 | A 30 | 1 1 31 | B B B 32 | 2 2 2 2 33 | 34 | H/W 9 35 | 36 | A 37 | A 2 38 | A 2 C 39 | A 2 C 4 40 | 41 | HW 10 42 | 43 | A 44 | A 1 45 | A 1 B 46 | A 1 B 2 47 | 48 | Concept of input a string from user and find it’s length 49 | 50 | -------------------------------------------------------------------------------- /Pattern/06 : F - E - Ladder patterns.c: -------------------------------------------------------------------------------- 1 | Question 1 2 | * * * 3 3 | * 4 | * 5 | * * * * * * 6 6 | * 7 | * 8 | * * * * * * * * * 9 9 | * 10 | * 11 | 12 | 13 | Question 2 14 | X X X X X X - 6 15 | X 1 16 | X X X X 4 17 | X 1 18 | XX 2 19 | X 1 20 | 21 | 22 | Question 3 23 | * * 2 24 | * 1 25 | * * * * 4 26 | * 2 27 | * 28 | * * * * * * 6 29 | * 3 30 | * 31 | * 32 | 33 | Question 4 34 | * 1 35 | **** 4 36 | *2 37 | * 38 | ******** 8 39 | * 3 40 | * 41 | * 42 | ************ 12 (3 X 4) 43 | Question 5 1, 3, 6, 10, 15 44 | 2 3 45 | * 1 46 | * 1 X 1 47 | 48 | * * * 3 49 | * * 2X2 50 | * * 51 | 52 | * * * * * 5 53 | * * * 3 X 3 54 | * * * 55 | * * * 56 | 57 | Question 6 58 | ***** 5 59 | * 3 60 | * 61 | * 62 | ********** 10 63 | * 64 | * 65 | * 66 | * 67 | * 68 | * 6 69 | *************** 15 70 | 71 | Question 7 72 | * * 2 73 | * 1 74 | * * * * * 5 75 | * * 76 | * * 2 X 2 77 | * * * * * * * * 8 78 | * * * 79 | * * * 80 | * * * 3 X 3 81 | * * * * * * * * * * * 11 82 | Skip 4 X 4 83 | 2 (3X1-1) 84 | 5 (3*2-1 85 | 8 (3*3-1 86 | 11 (3*4-1) 87 | 88 | 89 | Question 8 90 | 1 - * * * * * 5 (i%2 == 0) 3* 91 | Else 5* 92 | * 1 x 1 93 | 94 | 2 - * * * 3 95 | * * 2 X 2 96 | * * 97 | 98 | 3 -* * * * * 5 99 | * * * 3X3 100 | * * * 101 | * * * 102 | 103 | 4 - * * * 104 | 4X4 skip 105 | 106 | 107 | 1. 108 | 109 | * * 110 | * 111 | * 112 | * 113 | * * * * 114 | * 115 | * 116 | * 117 | * 118 | * 119 | * 120 | * * * * * * 121 | 122 | 123 | 2. 124 | * * * 125 | * 126 | * * * * * * 127 | * 128 | * 129 | * * * * * * * * * 130 | * 131 | ** 132 | 133 | 134 | 3. 135 | * 136 | * 137 | * * * 138 | * * 139 | * * 140 | * * * * * * 141 | * * * 142 | * * * 143 | * * * 144 | * * * * * * * * * 145 | 146 | 147 | 4. 148 | * 149 | * * * * 150 | * 151 | * 152 | * * * * * * * * 153 | * 154 | * 155 | * 156 | * * * * * * * * * * * * 157 | 158 | 5. 159 | * * * 160 | * 161 | * 162 | * 163 | * * * * * * 164 | * 165 | * 166 | * 167 | * 168 | * 169 | * 170 | * * * * * * * * * 171 | 172 | 173 | 6. 174 | * * * * * * * * * * 175 | * 176 | * * * * * * * * 177 | * 178 | * 179 | * * * * * * 180 | * 181 | * 182 | * 183 | * * * * 184 | * 185 | * 186 | * 187 | * 188 | * * 189 | * 190 | * 191 | * 192 | * 193 | * 194 | 195 | 196 | 7. 197 | * * * * * 198 | * 199 | * 200 | * 201 | * * * * * * * * * * 202 | * 203 | * 204 | * 205 | * 206 | * 207 | * 208 | * * * * * * * * * * * * * * * 209 | -------------------------------------------------------------------------------- /Pattern/07 : Spaced Patterns.c: -------------------------------------------------------------------------------- 1 | * * * * * | 1 2 3 4 5 | A B C D E 2 | * * * * * | 1 2 3 4 5 | A B C D E 3 | * * * * * | 1 2 3 4 5 | A B C D E 4 | * * * * * | 1 2 3 4 5 | A B C D E 5 | * * * * * | 1 2 3 4 5 | A B C D E 6 | 7 | 8 | * * * * * | 1 2 3 4 5 | A B C D E 9 | * * * * | 1 2 3 4 | A B C D 10 | * * * | 1 2 3 | A B C 11 | * * | 1 2 | A B 12 | * | 1 | A 13 | 14 | 15 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 16 | * * * * * * * | 1 2 3 4 5 6 7 | A B C D E F G 17 | * * * * * | 1 2 3 4 5 | A B C D E 18 | * * * | 1 2 3 | A B C 19 | * | 1 | A 20 | 21 | 22 | * | 1 | A 23 | * * * | 1 2 3 | A B C 24 | * * * * * | 1 2 3 4 5 | A B C D E 25 | * * * * * * * | 1 2 3 4 5 6 7 | A B C D E F G 26 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 27 | * * * * * * * | 1 2 3 4 5 6 7 | A B C D E F G 28 | * * * * * | 1 2 3 4 5 | A B C D E 29 | * * * | 1 2 3 | A B C 30 | * | 1 | A 31 | 32 | 33 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 34 | * * * * * * * | 1 2 3 4 5 6 7 | A B C D E F G 35 | * * * * * | 1 2 3 4 5 | A B C D E 36 | * * * | 1 2 3 | A B C 37 | * | 1 | A 38 | * * * | 1 2 3 | A B C 39 | * * * * * | 1 2 3 4 5 | A B C D E 40 | * * * * * * * | 1 2 3 4 5 6 7 | A B C D E F G 41 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 42 | -------------------------------------------------------------------------------- /Pattern/08 : Shape Pattern.c: -------------------------------------------------------------------------------- 1 | * * * * * | 1 2 3 4 5 | A B C D E 2 | * * | 1 5 | A E 3 | * * | 1 5 | A E 4 | * * | 1 5 | A E 5 | * * * * * | 1 2 3 4 5 | A B C D E 6 | 7 | 8 | * | 1 | A 9 | * * | 1 3 | A C 10 | * * | 1 5 | A E 11 | * * | 1 7 | A G 12 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 13 | 14 | 15 | 16 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 17 | * * | 1 7 | A G 18 | * * | 1 5 | A E 19 | * * | 1 3 | A C 20 | * | 1 | A 21 | 22 | 23 | 24 | * | * | A 25 | * * | * * | A C 26 | * * | * * | A E 27 | * * | * * | A G 28 | * * | * * | A I 29 | * * | * * | A G 30 | * * | * * | A E 31 | * * | * * | A C 32 | * | * | A 33 | 34 | 35 | 36 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 37 | * * | 1 7 | A G 38 | * * | 1 5 | A E 39 | * * | 1 3 | A C 40 | * | 1 | A 41 | * * | 1 3 | A C 42 | * * | 1 5 | A E 43 | * * | 1 7 | A G 44 | * * * * * * * * * | 1 2 3 4 5 6 7 8 9 | A B C D E F G H I 45 | 46 | 47 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Pattern & Array Questions and Answers 2 | # Importance of patterns, their applications, and how they can enhance problem-solving skills. 3 | Star, Number, Alphabet, Shaped Pattern Solutions and Video Script 4 | --------------------------------------------------------------------------------