ada/prog.l_ada
1
0
Fork 0
mirror of https://github.com/ada-dmitry/prog.l_ada.git synced 2026-09-24 09:10:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

dir.main added

Browse Source
This commit is contained in:
ada-dmitry
2023-04-25 08:05:41 +03:00
parent 62d99ba675
commit 1f8e90cb3d
37 changed files with 1018 additions and 321 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Home/PL/HW/Hanoi Towers/func.c
+15 -15
View File
@@ -1,14 +1,14 @@
#include "head.h"
void linked_print(LinkedList* l) {
void linked_print(LinkList* l) {
while (l != NULL) {
printf("%d %s\n", l->x, l->name);
l = l->next;
}
}
LinkedList* add_tail(LinkedList* l, LinkedList node) {
LinkList* add_tail(LinkList* l, LinkList node) {
if (l->x == 0 && !strcmp(l->name, "\0")) {
l->x = node.x;
memcpy(l->name, node.name, LEN);
@@ -17,10 +17,10 @@ LinkedList* add_tail(LinkedList* l, LinkedList node) {
return l;
}
LinkedList* res = l;
LinkList* res = l;
while (l->next != NULL) l = l->next;
LinkedList* tmp = malloc(sizeof(LinkedList));
LinkList* tmp = malloc(sizeof(LinkList));
tmp->x = node.x;
memcpy(tmp->name, node.name, LEN);
tmp->prev = l;
@@ -28,7 +28,7 @@ LinkedList* add_tail(LinkedList* l, LinkedList node) {
return res;
}
LinkedList* add_head(LinkedList* l, LinkedList node) {
LinkList* add_head(LinkList* l, LinkList node) {
if (l->x == 0 && !strcmp(l->name, "\0")) {
l->x = node.x;
memcpy(l->name, node.name, LEN);
@@ -37,7 +37,7 @@ LinkedList* add_head(LinkedList* l, LinkedList node) {
return l;
}
LinkedList* tmp = malloc(sizeof(LinkedList));
LinkList* tmp = malloc(sizeof(LinkList));
if (tmp == NULL)
exit(1);
@@ -49,19 +49,19 @@ LinkedList* add_head(LinkedList* l, LinkedList node) {
return tmp;
}
LinkedList* del_head(LinkedList* l) {
LinkList* del_head(LinkList* l) {
if (l == NULL) return NULL;
if (l->next == NULL) {
free(l);
return NULL;
}
LinkedList* tmp = l->next;
LinkList* tmp = l->next;
tmp->prev = NULL;
free(l);
return tmp;
}
void del_tail(LinkedList* l) {
void del_tail(LinkList* l) {
if (l == NULL) return;
else if (l->next == NULL) {
free(l);
@@ -69,13 +69,13 @@ void del_tail(LinkedList* l) {
return;
}
while (l->next != NULL) l = l->next;
LinkedList* tmp = l->prev;
LinkList* tmp = l->prev;
l->prev = NULL;
free(l);
tmp->next = NULL;
}
int len(LinkedList* l) {
int len(LinkList* l) {
int res = 0;
if (l->x == 0 && !strcmp(l->name, "\0"))
return 0;
@@ -87,7 +87,7 @@ int len(LinkedList* l) {
return res;
}
LinkedList get(LinkedList* l, int n) {
LinkList get(LinkList* l, int n) {
if (n > len(l)) exit(3);
int i;
for (i = 0; i < n; i++) {
@@ -96,7 +96,7 @@ LinkedList get(LinkedList* l, int n) {
return *l;
}
void tower_of_hanoi(int n, LinkedList* start, LinkedList* finish, LinkedList* tmp) {
void tower_of_hanoi(int n, LinkList* start, LinkList* finish, LinkList* tmp) {
if (n == 1) {
finish = add_head(finish, get(start, 0));
start = del_head(start);
@@ -118,11 +118,11 @@ void tower_of_hanoi(int n, LinkedList* start, LinkedList* finish, LinkedList* tm
linked_print(tmp);
}
void linked_free(LinkedList* l) {
void linked_free(LinkList* l) {
while (l->next != NULL) l = l->next;
while (l->prev != NULL) {
LinkedList* tmp = l;
LinkList* tmp = l;
l = l->prev;
free(tmp);
}
Home/PL/HW/Hanoi Towers/gen.c
+4 -4
View File
@@ -3,9 +3,9 @@
int main(int argc, char* argv[]) {
srand(time(0));
LinkedList* l1 = malloc(sizeof(LinkedList));
LinkedList* l2 = malloc(sizeof(LinkedList));
LinkedList* l3 = malloc(sizeof(LinkedList));
LinkList* l1 = malloc(sizeof(LinkList));
LinkList* l2 = malloc(sizeof(LinkList));
LinkList* l3 = malloc(sizeof(LinkList));
if (l1 == NULL || l2 == NULL || l3 == NULL)
exit(1);
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
s[j] = 'a' + rand() % 25;
s[j + 1] = '\0';
LinkedList l;
LinkList l;
l.x = i;
memcpy(l.name, s, LEN);
l.next = NULL;
Home/PL/HW/Hanoi Towers/head.h
+13 -13
View File
@@ -6,19 +6,19 @@
#define N 3
#define LEN 8
typedef struct LinkedList {
typedef struct LinkList {
int x;
char name[LEN];
struct LinkedList* next;
struct LinkedList* prev;
} LinkedList;
struct LinkList* next;
struct LinkList* prev;
} LinkList;
void linked_print(LinkedList* l);
LinkedList* add_tail(LinkedList* l, LinkedList node);
LinkedList* add_head(LinkedList* l, LinkedList node);
LinkedList* del_head(LinkedList* l);
void del_tail(LinkedList* l);
int len(LinkedList* l);
LinkedList get(LinkedList* l, int n);
void tower_of_hanoi(int n, LinkedList* start, LinkedList* finish, LinkedList* tmp);
void linked_free(LinkedList* l);
void linked_print(LinkList* l);
LinkList* add_tail(LinkList* l, LinkList node);
LinkList* add_head(LinkList* l, LinkList node);
LinkList* del_head(LinkList* l);
void del_tail(LinkList* l);
int len(LinkList* l);
LinkList get(LinkList* l, int n);
void tower_of_hanoi(int n, LinkList* start, LinkList* finish, LinkList* tmp);
void linked_free(LinkList* l);
Home/PL/HW/Hanoi Towers/HTapp.exe → Home/PL/HW/Stack Calculator/Yar/appCalk.exe
BIN
View File
Binary file not shown.
Home/PL/HW/Stack Calculator/Yar/function.c
+76
View File
@@ -0,0 +1,76 @@
#include "header.h"
void linked_print(LinkedList *l)
{
while (l != NULL)
{
printf("%lF\n", l->x);
l = l->next;
}
}
LinkedList *add_head(LinkedList *l, double x)
{
if (l == NULL)
{
l = malloc(sizeof(LinkedList));
if (l == NULL)
exit(1);
l->x = x;
l->next = NULL;
}
if (l->x == 0.0)
{
l->x = x;
l->next = NULL;
return l;
}
LinkedList *tmp = malloc(sizeof(LinkedList));
if (tmp == NULL)
exit(1);
tmp->next = l;
tmp->x = x;
return tmp;
}
LinkedList *del_head(LinkedList *l)
{
if (l == NULL)
return NULL;
else if (l->next == NULL)
{
free(l);
l = NULL;
return NULL;
}
LinkedList *tmp = l->next;
free(l);
l = NULL;
return tmp;
}
int len(LinkedList *l)
{
int res = 0;
while (l != NULL)
{
res++;
l = l->next;
}
return res;
}
LinkedList get(LinkedList *l, int n)
{
if (n > len(l))
exit(3);
int i;
for (i = 0; i < n; i++)
{
l = l->next;
}
return *l;
}
Home/PL/HW/Stack Calculator/Yar/general.c
+72
View File
@@ -0,0 +1,72 @@
#include "header.h"
#include <stdio.h>
int main(int argc, char *argv[])
{
srand(time(0));
LinkedList *numbers = malloc(sizeof(LinkedList));
if (numbers == NULL)
exit(1);
char c;
char flag = 'n';
while ((c = getchar()) != EOF)
{
if (c == '\n')
{
break;
}
else if (c == ' ')
{
flag = 's';
continue;
}
switch (c)
{
case '0' ... '9':
if (flag == 's')
{
numbers = add_head(numbers, (double)(c - '0'));
flag = 'n';
}
else
{
double a = get(numbers, 0).x;
numbers = del_head(numbers);
a = a * 10 + c - '0';
numbers = add_head(numbers, a);
}
break;
case '+':
case '-':
case '*':
case '/':
if (len(numbers) < 2)
{
printf("Invalid expression\n");
exit(2);
}
double a = get(numbers, 0).x;
numbers = del_head(numbers);
double b = get(numbers, 0).x;
numbers = del_head(numbers);
b = (c == '+') ? b + a : b;
b = (c == '-') ? b - a : b;
b = (c == '*') ? b * a : b;
b = (c == '/') ? b / a : b;
numbers = add_head(numbers, b);
break;
}
}
printf("res: %lF", get(numbers, 0).x);
free(numbers);
return 0;
}
Home/PL/HW/Stack Calculator/Yar/header.h
+18
View File
@@ -0,0 +1,18 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define N 5
typedef struct LinkedList
{
double x;
struct LinkedList *next;
} LinkedList;
void linked_print(LinkedList *l);
LinkedList *add_head(LinkedList *l, double x);
LinkedList *del_head(LinkedList *l);
int len(LinkedList *l);
LinkedList get(LinkedList *l, int n);
Home/PL/HW/Stack Calculator/calk.exe → Home/PL/HW/Stack Calculator/calkApp.exe
BIN
View File
Binary file not shown.
Home/PL/HW/Tests/hw3.c
+103
View File
@@ -0,0 +1,103 @@
#include <stdio.h>
#include <stdlib.h>
#define N 20
void selectionSort(int arr[], int n)
{
int i, j, tmp;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
if (arr[j] < arr[i])
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}
void bubbleSort(int arr[], int n)
{
int i, j, tmp;
for (i = 0; i < n; i++)
{
for (j = 0; j < n - 1; j++)
{
if (arr[j] > arr[j + 1])
{
tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
}
}
}
}
void insertionSort(int arr[], int n)
{
int i, j, tmp;
for (i = 1; i < n; i++)
{
for (j = 0; j < i; j++)
{
if (arr[i] < arr[j])
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}
int main(int argc, char *argv[])
{
srand(time(0));
int *arr1 = malloc(sizeof(int) * N);
int *arr2 = malloc(sizeof(int) * N);
int *arr3 = malloc(sizeof(int) * N);
if (!arr1 || !arr2 || !arr3)
{
printf("could not malloc\n");
exit(1);
}
int i;
for (i = 0; i < N; i++)
{
int d = rand() % 100;
arr1[i] = d;
arr2[i] = d;
arr3[i] = d;
}
selectionSort(arr1, N);
insertionSort(arr2, N);
bubbleSort(arr3, N);
printf("Selection sort: ");
for (i = 0; i < N; i++)
printf("%d ", arr1[i]);
printf("\nInsertion sort: ");
for (i = 0; i < N; i++)
printf("%d ", arr2[i]);
printf("\nBubble sort: ");
for (i = 0; i < N; i++)
printf("%d ", arr3[i]);
printf("\n");
free(arr1);
free(arr2);
free(arr3);
return 0;
}
Home/PL/HW/array_xor/xor_array.exe → Home/PL/HW/Tests/hw3.exe
BIN
View File
Binary file not shown.
Home/PL/HW/array_xor/func.c
+43 -25
View File
@@ -1,16 +1,20 @@
#include "header.h"
void node_print(Node* n) {
while (n != NULL) {
void node_print(Node *n)
{
while (n != NULL)
{
printf("%s\n", n->name);
n = n->next;
}
}
Node* add_tail(Node* n, char s[]) {
if (n == NULL) {
if ((n = malloc(sizeof(Node))) == NULL) {
Node *add_tail(Node *n, char s[])
{
if (n == NULL)
{
if ((n = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(1);
}
@@ -19,51 +23,62 @@ Node* add_tail(Node* n, char s[]) {
memcpy(n->name, s, LEN);
return n;
}
if (!strcmp(n->name, "\0")) {
if (!strcmp(n->name, "\0"))
{
memcpy(n->name, s, LEN);
n->next = NULL;
n->prev = NULL;
return n;
}
Node* res = n;
while (n->next != NULL) n = n->next;
Node* tmp = malloc(sizeof(Node));
Node *res = n;
while (n->next != NULL){
printf("%p\n", n);
n = n->next;
}
Node *tmp = malloc(sizeof(Node));
memcpy(tmp->name, s, LEN);
tmp->prev = n;
n->next = tmp;
return res;
}
Node get(Node* node, int n) {
Node get(Node *node, int n)
{
int i;
for (i = 0; i < n; i++) {
for (i = 0; i < n; i++)
{
node = node->next;
}
return *node;
}
int len(Node* n) {
int len(Node *n)
{
int res = 0;
while (n != NULL) {
while (n != NULL)
{
res++;
n = n->next;
}
return res;
}
Node* xor_find(Node* n1, Node* n2) {
Node *xor_find(Node *n1, Node *n2)
{
int i, j, f = 0;
Node* res = NULL;
if ((res = malloc(sizeof(Node))) == NULL) {
Node *res = NULL;
if ((res = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(3);
}
for (i = 0; i < len(n1); i++) {
for (j = 0; j < len(n2); j++) {
if (strcmp(get(n1, i).name, get(n2, j).name) == 0) {
for (i = 0; i < len(n1); i++)
{
for (j = 0; j < len(n2); j++)
{
if (strcmp(get(n1, i).name, get(n2, j).name) == 0)
{
f = 1;
}
}
@@ -72,9 +87,12 @@ Node* xor_find(Node* n1, Node* n2) {
f = 0;
}
for (i = 0; i < len(n2); i++) {
for (j = 0; j < len(n1); j++) {
if (strcmp(get(n2, i).name, get(n1, j).name) == 0) {
for (i = 0; i < len(n2); i++)
{
for (j = 0; j < len(n1); j++)
{
if (strcmp(get(n2, i).name, get(n1, j).name) == 0)
{
f = 1;
}
}
Home/PL/HW/array_xor/gen.c
+22 -14
View File
@@ -1,29 +1,37 @@
#include "header.h"
int main(int argc, char* argv[]) {
int main(int argc, char *argv[])
{
printf("Cto-Nibud\n");
srand(time(0));
Node* n1 = NULL;
Node* n2 = NULL;
Node* n3 = NULL;
if ((n1 = malloc(sizeof(Node))) == NULL || (n2 = malloc(sizeof(Node))) == NULL || (n3 = malloc(sizeof(Node))) == NULL) {
Node *n1 = NULL;
Node *n2 = NULL;
Node *n3 = NULL;
if ((n1 = malloc(sizeof(Node))) == NULL || (n2 = malloc(sizeof(Node))) == NULL || (n3 = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(2);
}
printf("Error here 1");
n1 = add_tail(n1, "bebebe");
printf("Error here 1\n");
int i;
for (i = 0; i < COUNT; i++) {
for (i = 0; i < COUNT; i++)
{
char s[LEN];
int j;
for (j = 0; j < LEN - 1; j++)
printf("sss\n");
for (j = 0; j < LEN - 1; j++)
s[j] = 'a' + rand() % 2;
s[LEN - 1] = '\0';
n1 = add_tail(n1, s);
for (j = 0; j < LEN - 1; j++)
s[j]= 'a' + rand() % 2;
n1 = add_tail(n1, s);
printf("11");
for (j = 0; j < LEN - 1; j++){
s[j] = 'a' + rand() % 2;
printf("22");
}
s[LEN - 1] = '\0';
n2 = add_tail(n2, s);
}
Home/PL/HW/array_xor/header.h
+9 -8
View File
@@ -6,14 +6,15 @@
#define COUNT 3
#define LEN 3
typedef struct Node {
typedef struct Node
{
char name[LEN];
struct Node* next;
struct Node* prev;
struct Node *next;
struct Node *prev;
} Node;
void node_print(Node* n);
Node* add_tail(Node* n, char s[]);
Node get(Node* node, int n);
Node* xor_find(Node* n1, Node* n2);
int len(Node* n);
void node_print(Node *n);
Node *add_tail(Node *n, char s[]);
Node get(Node *node, int n);
Node *xor_find(Node *n1, Node *n2);
int len(Node *n);
Home/PL/HW/hw04.04/Calculator/main.exe
BIN
View File
Binary file not shown.
Home/PL/HW/hw6/app.exe
BIN
View File
Binary file not shown.
Home/PL/HW/hw6/books.txt
+6
View File
@@ -0,0 +1,6 @@
1 fdxyqwb3
1 icotltwo
2 ysharmos
2 xhlbvpd3
3 owvischE
3 bmmuvuhM
Home/PL/HW/hw6/func.c
+166
View File
@@ -0,0 +1,166 @@
#include "head.h"
void st_rand(Book books[], int n) {
int i, j;
for (i = 0; i < n; i++) {
// books[i].len = rand() % 99 + 1;
books[i].len = rand() % 3 + 1;
for (j = 0; j < STR_LEN - 1; j++)
books[i].name[j] = 'a' + rand() % 25;
books[i].name[j + 1] = '\0';
}
}
void st_print(Book books[], int n) {
int i;
for (i = 0; i < n; i++)
printf("len: %3d; name: %s\n", books[i].len, books[i].name);
}
void swap(Book* b1, Book* b2) {
Book* tmp = malloc(sizeof(Book));
if (tmp == NULL) {
printf("could not malloc\n");
exit(1);
}
memcpy(tmp, b1, sizeof(Book));
memcpy(b1, b2, sizeof(Book));
memcpy(b2, tmp, sizeof(Book));
free(tmp);
}
void selection_sort(Book books[], int n) {
int i, j;
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
if (books[j].len < books[i].len)
swap(books + i, books + j);
}
}
}
Book* bin_search(Book books[], int n, int key) {
Book* res = NULL;
int low = 0, high = n - 1;
while (low <= high) {
int mid = (high + low) / 2;
if (books[mid].len == key) {
res = &books[mid];
break;
}
low = (books[mid].len < key) ? mid + 1: low;
high = (books[mid].len > key) ? mid - 1: high;
}
return res;
}
void pst(Book books[], int size, int n) {
if (n >= size) {
printf("index bigger then length of the array\n");
exit(2);
}
printf("len: %3d; name: %s\n", books[n].len, books[n].name);
}
int matches_number(Book b[], int n, int match) {
int res = 0, i;
for (i = 0; i < n; i++) {
if (b[i].len == match) res++;
else if (b[i].len > match) break;
}
return res;
}
int find_pairs_easy(Book b1[], int n1, Book b2[], int n2) {
int res = 0, i;
for (i = 0; i < n1; i++) {
Book* b_res = bin_search(b2, n2, b1[i].len);
if (b_res == NULL) continue;
res++;
}
return res;
}
int find_pairs_advanced(Book b1[], int n1, Book b2[], int n2) {
int res = 0, i;
for (i = 0; i < n1; i++) {
Book* b_res = bin_search(b2, n2, b1[i].len);
if (b_res == NULL) continue;
res += matches_number(b2, n2, b1[i].len);
}
return res;
}
void st_fprintf(Book books[], int n, char path[], char access[]) {
int i;
FILE* f = fopen(path, access);
if (f == NULL) {
printf("Could not open file %s\n", path);
exit(3);
}
for (i = 0; i < n; i++) {
fprintf(f, "%d %s\n", books[i].len, books[i].name);
}
fclose(f);
}
int lines_numf(char path[]) {
int res = 0;
char c;
FILE* f = fopen(path, "r");
if (f == NULL) {
printf("Could not open file %s\n", path);
exit(3);
}
while ((c = fgetc(f)) != EOF) {
if (c == '\n') res++;
}
fclose(f);
return res;
}
int lines_num(char path[]) {
int res = 0, flag = 0;
char c;
FILE* f = fopen(path, "r");
if (f == NULL) {
printf("Could not open file %s\n", path);
exit(3);
}
while ((c = fgetc(f)) != EOF) {
if (c != '\n') flag = 1;
if (c == '\n' && flag) {
res++;
flag = 0;
}
}
fclose(f);
return res + flag;
}
void st_fscanf(Book b[], int n, char path[]) {
int i;
FILE* f = fopen(path, "r");
if (f == NULL) {
printf("Could not open file %s\n", path);
exit(3);
}
for (i = 0; i < n; i++) {
fscanf(f, "%d %s\n", &b[i].len, b[i].name);
}
fclose(f);
}
Home/PL/HW/hw6/gen.c
+71
View File
@@ -0,0 +1,71 @@
#include "head.h"
int main(int argc, char* argv[]) {
srand(time(0));
Book* books1 = malloc(sizeof(Book) * N);
Book* books2 = malloc(sizeof(Book) * N);
if (books1 == NULL || books2 == NULL) {
printf("could not malloc\n");
exit(1);
}
st_rand(books1, N);
st_rand(books2, N);
printf("First array:\n");
st_print(books1, N);
printf("\nSecond array:\n");
st_print(books2, N);
selection_sort(books1, N);
selection_sort(books2, N);
printf("\nFirst array after sort:\n");
st_print(books1, N);
printf("\nSecond array after sort:\n");
st_print(books2, N);
Book* res = bin_search(books1, N, 15);
if (res == NULL)
printf("\nNo such book\n");
else
printf("\nLength: %2d; name: %s\n", res->len, res->name);
printf("\nElement in first array: ");
pst(books1, N, (int)(N * 0.7));
printf("Element in second array: ");
pst(books2, N, (int)(N * 0.3));
printf("\nNumber of pairs (easy realization): %d\n", find_pairs_easy(books1, N, books2, N));
printf("Number of pairs (advanced realization): %d\n", find_pairs_advanced(books1, N, books2, N));
st_fprintf(books1, N, "books.txt", "w");
st_fprintf(books2, N, "books.txt", "a");
int line_number = lines_numf("books.txt");
printf("\nNumber of lines in books.txt is %d\n", line_number);
Book* books3 = malloc(sizeof(Book) * line_number);
if (books3 == NULL) {
printf("could not malloc\n");
free(books1);
free(books2);
exit(1);
}
st_fscanf(books3, line_number, "books.txt");
selection_sort(books3, line_number);
printf("\nThird array is:\n");
st_print(books3, line_number);
free(books1);
free(books2);
free(books3);
return 0;
}
Home/PL/HW/hw6/head.h
+29
View File
@@ -0,0 +1,29 @@
#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define N 3
#define STR_LEN 8
typedef struct Book {
int len;
char name[STR_LEN];
} Book;
void st_rand(Book books[], int n);
void st_print(Book books[], int n);
void swap(Book* b1, Book* b2);
void selection_sort(Book books[], int n);
Book* bin_search(Book books[], int n, int key);
void pst(Book books[], int size, int n);
int matches_number(Book b[], int n, int match);
int find_pairs_easy(Book b1[], int n1, Book b2[], int n2);
int find_pairs_advanced(Book b1[], int n1, Book b2[], int n2);
void st_fprintf(Book books[], int n, char path[], char access[]);
int lines_numf(char path[]);
int lines_num(char path[]);
void st_fscanf(Book b[], int n, char path[]);
Home/PL/HW/hw7/app.exe
BIN
View File
Binary file not shown.
Home/PL/HW/hw7/func.c
+206
View File
@@ -0,0 +1,206 @@
#include "head.h"
void linked_print(LinkedList *l)
{
while (l != NULL)
{
printf("%d %s\n", l->x, l->name);
l = l->next;
}
}
LinkedList *add_tail(LinkedList *l, int x, char name[])
{
if (l->x == 0 && !strcmp(l->name, "\0"))
{
l->x = x;
memcpy(l->name, name, STR_LEN);
l->next = NULL;
l->prev = NULL;
return l;
}
LinkedList *res = l;
while (l->next != NULL)
l = l->next;
LinkedList *tmp = malloc(sizeof(LinkedList));
tmp->x = x;
memcpy(tmp->name, name, STR_LEN);
tmp->prev = l;
l->next = tmp;
return res;
}
LinkedList *add_head(LinkedList *l, int x, char name[])
{
if (l->x == 0 && !strcmp(l->name, "\0"))
{
l->x = x;
memcpy(l->name, name, STR_LEN);
l->next = NULL;
l->prev = NULL;
return l;
}
LinkedList *tmp = malloc(sizeof(LinkedList));
if (tmp == NULL)
exit(1);
tmp->next = l;
l->prev = tmp;
tmp->prev = NULL;
tmp->x = x;
memcpy(tmp->name, name, STR_LEN);
return tmp;
}
LinkedList *del_head(LinkedList *l)
{
if (l == NULL)
return NULL;
else if (l->next == NULL)
{
free(l);
l = NULL;
return NULL;
}
LinkedList *tmp = l->next;
tmp->prev = NULL;
free(l);
l = NULL;
return tmp;
}
void del_tail(LinkedList *l)
{
if (l == NULL)
return;
else if (l->next == NULL)
{
free(l);
l = NULL;
return;
}
while (l->next != NULL)
l = l->next;
LinkedList *tmp = l->prev;
l->prev = NULL;
free(l);
tmp->next = NULL;
}
int len(LinkedList *l)
{
int res = 0;
while (l != NULL)
{
res++;
l = l->next;
}
return res;
}
void swap(LinkedList *l, int first, int second)
{
if (first >= len(l) || second >= len(l))
exit(3);
int i, min, max;
min = (first <= second) ? first : second;
max = first + second - min;
for (i = 0; i < min; i++)
{
if (l != NULL)
l = l->next;
else
exit(2);
}
LinkedList *tmp = l;
for (i = 0; i < max - min; i++)
{
if (l != NULL)
l = l->next;
else
exit(2);
}
LinkedList temp = *l;
l->x = tmp->x;
tmp->x = temp.x;
memcpy(l->name, tmp->name, STR_LEN);
memcpy(tmp->name, temp.name, STR_LEN);
}
LinkedList get(LinkedList *l, int n)
{
if (n > len(l))
exit(3);
int i;
for (i = 0; i < n; i++)
{
l = l->next;
}
return *l;
}
void select_sort(LinkedList *l)
{
if (l == NULL || l->next == NULL)
return;
int n = len(l), i, j;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
if (get(l, j).x < get(l, i).x)
swap(l, i, j);
}
}
}
void list_fprintf(LinkedList *l, char path[])
{
FILE *f = fopen(path, "w");
if (f == NULL)
exit(4);
int i, n = len(l);
for (i = 0; i < n; i++)
{
fprintf(f, "%d %s\n", l->x, l->name);
l = l->next;
}
fclose(f);
}
LinkedList *list_fscanf(char path[])
{
FILE *f = fopen(path, "r");
if (f == NULL)
exit(5);
LinkedList *tmp = malloc(sizeof(LinkedList));
tmp->prev = NULL;
tmp->next = NULL;
int tmp_x, i;
char s[STR_LEN] = {'\0'};
for (i = 0; fscanf(f, "%d %s\n", &tmp_x, s) != EOF; i++)
{
if (i == 0)
{
tmp->x = tmp_x;
memcpy(tmp->name, s, STR_LEN);
}
else
add_tail(tmp, tmp_x, s);
}
fclose(f);
return tmp;
}
Home/PL/HW/hw7/gen.c
+52
View File
@@ -0,0 +1,52 @@
#include "head.h"
int main(int argc, char *argv[])
{
srand(time(0));
LinkedList *l = malloc(sizeof(LinkedList));
if (l == NULL)
exit(1);
int i, j;
for (i = 0; i < N; i++)
{
char s[STR_LEN];
for (j = 0; j < STR_LEN - 1; j++)
s[j] = 'a' + rand() % 25;
s[j + 1] = '\0';
add_tail(l, rand() % 100, s);
}
printf("\nAfter add_tail(%d):\n", len(l));
linked_print(l);
l = add_head(l, 5, "head");
printf("\nAfter add_head(%d):\n", len(l));
linked_print(l);
l = del_head(l);
printf("\nAfter del_head(%d):\n", len(l));
linked_print(l);
swap(l, 0, 1);
printf("\nAfter swap first and second el:\n");
linked_print(l);
del_tail(l);
printf("\nAfter del_tail(%d):\n", len(l));
linked_print(l);
select_sort(l);
printf("\nAfter sort:\n");
linked_print(l);
printf("\nWriting to file test.txt\n");
list_fprintf(l, "test.txt");
printf("\nRead from file test.txt:\n");
LinkedList *l2 = list_fscanf("test.txt");
linked_print(l2);
free(l);
return 0;
}
Home/PL/HW/hw7/head.h
+30
View File
@@ -0,0 +1,30 @@
#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define N 5
#define STR_LEN 8
typedef struct LinkedList
{
int x;
struct LinkedList *next;
struct LinkedList *prev;
char name[STR_LEN];
} LinkedList;
void linked_print(LinkedList *l);
LinkedList *add_tail(LinkedList *l, int x, char name[]);
LinkedList *add_head(LinkedList *l, int x, char name[]);
LinkedList *del_head(LinkedList *l);
void del_tail(LinkedList *l);
int len(LinkedList *l);
LinkedList get(LinkedList *l, int n);
void swap(LinkedList *l1, int i, int j);
void select_sort(LinkedList *l);
void list_fprintf(LinkedList *l, char path[]);
LinkedList *list_fscanf(char path[]);
Home/PL/HW/zero_find/gen.c
+32
View File
@@ -0,0 +1,32 @@
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
double f(double x) { return exp(x) + sin(2.0 * x); }
int main(int argc, char *argv[]) {
srand(time(0));
double start = -4.0, finish = -3.0, e = 1e-6, mid = (finish + start) / 2.0;
if (f(start) * f(finish) > 0) {
printf("Could not find\n");
exit(0);
}
while (fabs(f(mid)) >= e) {
mid = (finish + start) / 2.0;
if (f(mid) > 0) {
start = (f(start) > f(finish)) ? mid : start;
finish = (f(start) < f(finish)) ? mid : finish;
} else {
start = (f(start) < f(finish)) ? mid : start;
finish = (f(start) > f(finish)) ? mid : finish;
}
}
printf("Found: %lF\n", start);
return 0;
}