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 --- .../81281/c2html/exampleCodeAndTestPage/page.html | 266 --------------------- 1 file changed, 266 deletions(-) delete mode 100644 homework/81281/c2html/exampleCodeAndTestPage/page.html (limited to 'homework/81281/c2html/exampleCodeAndTestPage/page.html') 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