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

123

Browse Source
This commit is contained in:
ada-dmitry
2023-04-01 22:43:00 +03:00
parent fa03214161
commit 60d07bfca5
5 changed files with 97 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files
PL/HW/DZf28.03/funcHeader.h
+12 -14
View File
@@ -7,21 +7,19 @@
#include <string.h>
#include <windows.h>
typedef struct People {
typedef struct People
{
int count;
char name[LEN];
} People;
void print_struc(People professions[], int n);
void sort_sel(People professions[], int n);
void st_rand(People professions[], int n);
People* binSearch(People professions[], int n, int k);
void pst(People professions[], int s, int n);
int find_para(People t1[], int n1, People t2[], int n2);
void st_fprintf(People professions[], int n, char path[], char access[]);
int lines_numf(char path[]);
void st_fscanf(People t[], int n, char path[]);
void swap(People* t1, People* t2);
void print_struc(People professions[], int n);
void sort_sel(People professions[], int n);
void st_rand(People professions[], int n);
People *binSearch(People professions[], int n, int k);
void pst(People professions[], int s, int n);
int find_para(People t1[], int n1, People t2[], int n2);
void st_fprintf(People professions[], int n, char path[], char access[]);
int lines_numf(char path[]);
void st_fscanf(People t[], int n, char path[]);
void swap(People *t1, People *t2);