From aeb0d4f887a0c18c36b59acc7b5df08e62020c50 Mon Sep 17 00:00:00 2001 From: Dimitar Trendafilov Date: Sun, 11 Oct 2020 21:32:48 +0300 Subject: Removed old homeworks --- .../c2html/exampleCodeAndTestPage/initialTest.c | 99 -------- .../c2html/exampleCodeAndTestPage/messyCode.c | 139 ----------- .../81281/c2html/exampleCodeAndTestPage/page.html | 266 --------------------- 3 files changed, 504 deletions(-) delete mode 100644 homework/81281/c2html/exampleCodeAndTestPage/initialTest.c delete mode 100644 homework/81281/c2html/exampleCodeAndTestPage/messyCode.c delete mode 100644 homework/81281/c2html/exampleCodeAndTestPage/page.html (limited to 'homework/81281/c2html/exampleCodeAndTestPage') diff --git a/homework/81281/c2html/exampleCodeAndTestPage/initialTest.c b/homework/81281/c2html/exampleCodeAndTestPage/initialTest.c deleted file mode 100644 index 7f1b4cd..0000000 --- a/homework/81281/c2html/exampleCodeAndTestPage/initialTest.c +++ /dev/null @@ -1,99 +0,0 @@ -#include -#include -#include -int N = 0; -int a[750001] = {0}; -/*Problem Secrect DAA - */ -//// mauuu - -int matrix[3][3] = {{0, 0, 0}, {0, 1, 0}, {0, 1, 1}}; -int arr[3] = {0, 0, 0}; -char matrix[3][3] = {{'0', '0', '0'}, {'0', '1', '0'}, {'0', '1', '1'}}; -void swap(int* i, int* j) -{ - int t = *i; - *i = *j; - (*i)->go(); - *j = t; -} -int partition(int l, int r) -{ - int randIdx = l + rand() % (r - l); - - int pivot = a[randIdx]; - - swap(&a[l], &a[randIdx]); - int ind = l; - for (int i = l + 1; i < r; i++) - { - if (a[i] <= pivot) - { - ind++; - swap(&a[i], &a[ind]); - } - } - - swap(&a[l], &a[ind]); - switch (allala) - { - case 0: - o = 9; - break; - default: - break; - } - return ind; -} -void quickSort(int l, int r) -{ - if (l < r) - { - int idx = partition(l, r); - quickSort(l, idx); - quickSort(idx + 1, r); - } -} -int binarySearch(int k) -{ - - int middle, left = 0, right = N - 1; - if (k < a[left]) - return (-1); - if (k == a[left]) - return (left + 1); - if (k > a[right]) - return (-1); - - while (right - left > 1) - { - middle = (left + right) / 2; - if (k <= a[middle]) - right = middle; - else - left = middle; - } - int j = 4 * 5; - int k = 6 * j; - return ((right <= N - 1 && a[right] == k) ? (right + 1) : (-1)); -} - -int main() -{ - srand(time(0)); - scanf("%d", &N); - for (int i = 0; i < N; ++i) - { - scanf("%d ", &a[i]); - } - quickSort(0, N); - - int tmp = 0; - scanf("%d", &tmp); - while (tmp != 0) - { - printf("%d\n", binarySearch(tmp)); - scanf("%d", &tmp); - } - return 0; -} diff --git a/homework/81281/c2html/exampleCodeAndTestPage/messyCode.c b/homework/81281/c2html/exampleCodeAndTestPage/messyCode.c deleted file mode 100644 index 4ac99b4..0000000 --- a/homework/81281/c2html/exampleCodeAndTestPage/messyCode.c +++ /dev/null @@ -1,139 +0,0 @@ -#include -#include -#include -int N = 0; -int a[750001] = {0}; -struct Books -{ - char title[50]; - char author[50]; - char subject[100]; - int book_id; - void dummy() - { - printf("Hello\n"); - for (size_t i = 0; i < count; i++) - { - /*yes*/ - } - } -} book; - -typedef struct temp -{ - int a; - -} classTemp; - -void classTemp_GetData(classTemp* pThis) -{ - printf("Enter value of a : "); - scanf("%d", &(pThis->a)); -} - -classTemp T; - -struct point* biggest_point(size_t size, - struct point* points, - struct point* (*point_compare)(struct point* a, - struct point* b)) -{ - int i; - struct point* biggest = NULL; - - for (i = 0; i < size; i++) - { - biggest = point_compare(biggest, points + i); - } - return biggest; -} - -int matrix[3][3] = {{0, 0, 0}, {0, 1, 0}, {0, 1, 1}}; -int arr[3] = {0, 0, 0}; -char matrix[3][3] = {{'0', '0', '0'}, {'0', '1', '0'}, {'0', '1', '1'}}; -/*Problem Secrect DAA -/// lalalallala -*/ -//// mauuu -int a, b; -void swap(int* i, int* j) -{ -int t = *i; -*i = *j;(*i)->go(); -*j = t; -do -{ -printf("mau\n"); - } while (i > 1); -} -int partition(int l, int r) -{ -int randIdx = l + rand() % (r - l); -int pivot = a[randIdx]; - -swap(&a[l], &a[randIdx]); -int ind = l; -for (int i = l + 1; i < r; i++) -{ -if (a[i] <= pivot) -{ -ind++; -swap(&a[i], &a[ind]); -switch (allala) - { - case 0: - o = 9; - break; - default: - break; - } - } - } - - swap(&a[l], &a[ind]); - return ind; -} -void quickSort(int l, int r) -{ - if (l < r) - { - int idx = partition(l, r); - quickSort(l, idx); - quickSort(idx + 1, r); - } -} -int binarySearch(int k) -{ - int middle, left = 0, right = N - 1; - if (k < a[left]) - return (-1); - if (k == a[left]) - return (left + 1); - if (k > a[right]) - return (-1); while (right - left > 1) - { - middle = (left + right) / 2; - if (k <= a[middle]) -right = middle; - else - left = middle; - } - return ((right <= N - 1 && a[right] == k) ? (right + 1) : (-1)); -} - -int main() -{ - srand(time(0)); - scanf("%d", &N); - for (int i = 0; i < N; ++i) - { - scanf("%d ", &a[i]); - } - quickSort(0, N); - int tmp = 0; scanf("%d", &tmp);while (tmp != 0) - { -printf("%d\n", binarySearch(tmp)); - scanf("%d", &tmp); - } - return 0; -} diff --git a/homework/81281/c2html/exampleCodeAndTestPage/page.html b/homework/81281/c2html/exampleCodeAndTestPage/page.html deleted file mode 100644 index 15ebd7a..0000000 --- a/homework/81281/c2html/exampleCodeAndTestPage/page.html +++ /dev/null @@ -1,266 +0,0 @@ - - - - - hello.c - - - - - - 
#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-int N = 0;
-int a[750001] = {0};
-
-
{
-    char title[50];
-    char author[50];
-    char subject[100];
-    int book_id;
-
-
    {
-        printf("Hello\n");
-
-
        {
-            /*yes*/
-        }
-
-
    }
-
-
} book;
-
-
typedef struct temp
-{
-    int a;
-} classTemp;
-
-
-
{
-    printf("Entervalueofa:");
-    scanf("%d", & (pThis->a));
-}
-
-
classTemp T;
-
-
{
-    int i;
-    struct point * biggest = NULL;
-
-
    {
-        biggest = point_compare(biggest, points + i);
-    }
-
-
    return biggest;
-}
-
-
int matrix[3][3] = {{0, 0, 0}, {0, 1, 0}, {0, 1, 1}};
-int arr[3] = {0, 0, 0};
-char matrix[3][3] = {{'0', '0', '0'}, {'0', '1', '0'}, {'0', '1', '1'}};
-/*Problem Secrect DAA
-/// lalalallala
-*/
-//// mauuu
-int a, b;
-
-
{
-    int t = *i;
-    *i= *j;
-    (*i)->go();
-    *j= t;
-
-
    {
-        printf("mau\n");
-    } while (i > 1);
-
-
}
-
-

-
{
-    int randIdx = l + rand() % (r - l);
-    int pivot = a[randIdx];
-    swap(&a[l], &a[randIdx]);
-    int ind = l;
-
-
    {
-
-
        {
-            ind++;
-            swap(&a[i], &a[ind]);
-
-
            {
-                case 0 :
-                    o = 9;
-                    break;
-                default :
-                    break;
-            }
-
-
        }
-
-
    }
-
-
    swap(&a[l], &a[ind]);
-    return ind;
-}
-
-

-
{
-
-
    {
-        int idx = partition(l, r);
-        quickSort(l, idx);
-        quickSort(idx + 1, r);
-    }
-
-
}
-
-

-
{
-    int middle, left = 0, right = N - 1;
-    if (k < a[left])
-        return (-1);
-    if (k == a[left])
-        return (left + 1);
-    if (k > a[right])
-        return (-1);
-
-
    {
-        middle = (left + right) / 2;
-        if (k <= a[middle])
-            right = middle;
-        else
-            left = middle;
-    }
-
-
    return ((right <= N - 1 && a[right] == k) ? (right + 1) : (-1));
-}
-
-

-
{
-    srand(time(0));
-    scanf("%d", &N);
-
-
    {
-        scanf("%d", &a[i]);
-    }
-
-
    quickSort(0, N);
-    int tmp = 0;
-    scanf("%d", &tmp);
-
-
    {
-        printf("%d\n", binarySearch(tmp));
-        scanf("%d", &tmp);
-    }
-
-
    return 0;
-}
-
-
 
-
- - - -- cgit v1.3.1-23-gd82d