This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
void gcd(int, int); | |
int main() | |
{ | |
int num1, num2; | |
printf("Enter two numbers: "); | |
scanf("%d %d", &num1, &num2); | |
gcd((num1 >= num2) ? num1, num2 : num2, num1); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int sum(int); | |
int main() | |
{ | |
int num; | |
printf("Enter a number: "); | |
scanf("%d", &num); | |
printf("\nSum of first %d number is: %d\n", num, sum(num)); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
void binary(int); | |
int main() | |
{ | |
int num, place = 1, bin = 0, rem; | |
printf("Enter a number: "); | |
scanf("%d", &num); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* ------------ Print prime numbers using sieve of Eratosthenes. ------------ */ | |
#include <stdio.h> | |
int main() | |
{ | |
int size = 100; | |
int arr[size]; | |
int i, j, k; | |
int half; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
void getData(int *, int *, int); | |
int main() | |
{ | |
int arr[] = {11, 44, -2, 351, -1129, 34, 3, -124, 25, -9}; | |
int size = sizeof(arr) / sizeof(arr[0]); | |
int count[4]; | |
getData(arr, count, size); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int search(int *, int, int, int); | |
int main() | |
{ | |
int arr[] = {2, 4, 8, 16, 32, 64, 128, 256}; | |
int size = sizeof(arr) / sizeof(arr[0]); | |
int find = 128; | |
printf("%d is found at Array index: %d.", find, search(arr, 0, (size - 1), find)); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Simulator | |
1. Switch between light mode and dark mode: Shift ⇧ + Cmd ⌘ + A | |
Mac | |
1. Spotlight: Cmd ⌘ + SpaceBar | |
2. Switch windows of same app | |
(i) Forward: Cmd ⌘ + ` (tilde) key. | |
(ii) Backward: Cmd ⌘ + Shift ⇧ + ` (tilde) key. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
func findThreeLargeNumbers(from numberArray: [Int]) -> [Int] { | |
guard !numberArray.isEmpty, numberArray.count > 2 else { | |
return [] | |
} | |
var resultArray = Array(repeatElement(Int.min, count: 3)) | |
for number in numberArray { | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Brochette-case / Kebab case => Hello_World | |
lowerCamelCase / Dromedary Case => helloWorld | |
Pascal case / Upper Camal Case => HelloWorld | |
Snake case | |
Snake case starts with a lower case letter, and uses an underscore to separate words (although some variations start with an upper case). | |
Generally associated with the C programming language, although it actually started life with no particular name: | |
first + _ + Number = first_Number | |
Examples: my_func(), my_var, name, test |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Brute + Better + Optimal ! | |
// Brute = Sort array and find the minimum ! | |
int print2largest(int arr[], int n) { | |
// I'm using Bubble Sort. | |
for(int i = 0; i <= n - 2; i++) | |
{ | |
boolean didSwapHappen = false; |
OlderNewer