Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include <math.h>
- // sap xep tang dan mang int
- void bubbleSort(int arr[], int size) { // < khac kieu du lieu: doi int ~> char, double, float
- int temp; // < khac kieu du lieu: doi int ~> char, double, float
- int i, j;
- for (i = 0; i < size; i++) {
- for (j = 0; j < size-1-i; j++) {
- if (arr[j] > arr[j+1]) { // giam dan: doi dau > thanh <
- temp = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = temp;
- }
- }
- }
- }
- // sap xep chuoi ki tu tang dan
- void bubbleSort(char arr[][], int size) {
- char temp[1000];
- int i, j;
- for (i = 0; i < size; i++) {
- for (j = 0; j < size-1-i; j++) {
- if (strcmp([j], arr[j+1]) > 0) { // giam dan: doi dau > thanh <
- strcpy(temp, arr[j]);
- strcpy(arr[j], arr[j+1]);
- strcpy(arr[j+1], temp);
- }
- }
- }
- }
- // 1: TRUE, 0:FALSE
- int symmetric(int arr[], int size) {
- // 1 2 3 4 3 2 1
- // 0 1 2 3 4 5 6: 0vs6 1v5 2v4 3v3
- int first = 0;
- int last = size - 1;
- while (first <= last) {
- if (arr[first] != arr[last]) {
- return 0;
- }
- }
- return 1;
- }
- // 1: TRUE, 0:FALSE
- int isPrime(int number) {
- if (number < 2) return 0;
- if (number == 2) return 1;
- int i;
- for (i = 2; i <= sqrt(number); i++) {
- if (number % i == 0) {
- return 0;
- }
- }
- return 1;
- }
- // 1: TRUE, 0:FALSE
- int allOdd(int arr[], int size) {
- int i;
- for (i = 0; i < size; i++) {
- if (arr[i]%2 == 0) {
- return 0;
- }
- }
- return 1;
- }
- // 1: TRUE, 0:FALSE
- int allEven(int arr[], int size) {
- int i;
- for (i = 0; i < size; i++) {
- if (arr[i]%2 != 0) {
- return 0;
- }
- }
- return 1;
- }
- int main() {
- int n;
- scanf("%d", &n);
- int arr[n];
- int i;
- for (i = 0; i < n; i++) {
- scanf("%d", &arr[i]);
- }
- for (i = 0; i < n; i++) {
- if (i==0) {
- printf("%d", arr[i]);
- } else {
- printf(" %d", arr[i]);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement