idan/college-C
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

First Upload

Browse Source
This commit is contained in:
Idan Cohen
2022-02-25 15:33:16 +02:00
commit 0c74d10f0d
295 changed files with 74784 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2380
22- recorstion2/General.c Normal file
View File

File diff suppressed because it is too large Load Diff

219
22- recorstion2/General.h Normal file
View File

@@ -0,0 +1,219 @@
#include <stdio.h>
#include <malloc.h>
#define DAYS_IN_MONTH 30
#define MONTHS_IN_YEAR 12
#define ONE_HUNDRED 100
#define ONE_THOSEND 10000
#define BOOLEAN unsigned short
#define TRUE 1
#define FALSE 0
#define SEVEN 7
#define EIGHT 8
#define TEN 10
#define TWELVE 12
#define THIRTY 30
#define ZERO 0
#define ONE 1
#define TWO 2
#define THREE 3
#define FOUR 4
#define FIVE 5
#define TAKE_SIGNED_MATH(x) (((2 * (x)) + 1) % 2)
#define TAKE_SIGNED(x) ((x) < 0) ? -1 : 1
#define ABS(x) (x) * (((2 * (x)) + 1) % 2)
#define MAX(x, y) (x > y) ? x : y
#define MIN(x, y) (x < y) ? x : y
#define BACKSLASH_ZERO '\0'
#define MAX_SIZE_STRING 256
#define MASK_FIRST_BIT 0x1
typedef char string[MAX_SIZE_STRING];
typedef unsigned char byte;
typedef unsigned short word;
typedef unsigned int dblword;
typedef union
{
int int_;
char char_;
double double_;
void * pointer;
} Data_Type;
typedef struct
{
Data_Type * values;
unsigned int items;
} stack;
typedef struct
{
Data_Type * values;
unsigned int items;
} queue;
struct LLL
{
Data_Type value;
struct LLL * next;
};
struct DLLL
{
Data_Type info;
struct DLLL * next;
struct DLLL * prev;
};
struct CLLL
{
Data_Type info;
struct CLLL * next;
};
struct CDLLL
{
Data_Type info;
struct CDLLL * next;
struct CDLLL * prev;
};
struct SM
{
Data_Type info;
int row;
int col;
struct SM * col_next;
struct SM * row_next;
};
typedef struct SM SM;
typedef struct LLL LLL;
typedef struct DLLL DLLL;
typedef struct CLLL CLLL;
typedef struct CDLLL CDLLL;
void ChangeYearsToMonths(int *years, short *month);
void SwapNumbers(int *ptr_number1, int *ptr_number2);
void SwapChars(char *ptr_char1, char *ptr_char2);
void ChangeMonthsToDays(short *months, int *days);
void ChangeDateToDays(int *date, int *days);
void ChangeDaysToMonths(int *days, int *months);
void ChangeMonthsToYears(int *months, int *years);
void ChangeDaysToDate(int *days, int *date);
int DifferentDates(int *date1, int *date2, int *different);
BOOLEAN EvenNumber(int num);
int OppositeNumber(int num);
int OddDigitsInNumber(int num);
int EvenDigitsInNumber(int num);
int SumOfNumberWithPositiveDigitsAndNumberWithNegativeDigits(int num);
double Power(float num, short pow);
int GetRest(double num, unsigned short count_digits);
unsigned short CountDigits(int num);
float ConvertBaseToDeciaml(float num, float base, unsigned short rest_size);
double Sum(double number1, double number2);
int SumOfDigitsNumber(double number);
int SumEvenDigits(double number);
int SumOddDigits(double number);
BOOLEAN CommonDigitsInTwoNumbers(double number1, double number2);
double Sqrt(double number, short root);
BOOLEAN PrimeNumber(int number);
double Module(double number, double div); // TODO : FIX IT
BOOLEAN DigitInNumber(double number, unsigned short digit);
int ConcatenationNumbers(short number1, short number2);
int Multiplication(short number1, short multiply); // TODO : FIX IT
int GetDenominator(double number);
short GetCounter(double number);
double Divide(double number, double div); // TODO : FIX IT
BOOLEAN SumInArray(int array[], unsigned int size, int sum);
BOOLEAN ChangeBool(BOOLEAN bool1);
BOOLEAN Equality(int number1, int number2);
BOOLEAN NumBBiggerThenNumA(int a, int b);
unsigned int SumOfTimesCharsArray1InCharsArray2(char array1[],
unsigned int array1_size,
char array2[],
unsigned int array2_size);
unsigned int CreateMask(unsigned short size, unsigned short digit_of_mask);
unsigned short CountADigitInNumber(int number, unsigned short digit);
short GetDigit(int number, unsigned short location);
unsigned short CountOfIdenticalDigitsInSomeIndex(int number1, int number2);
unsigned short CountOfIdenticalDigits(int number1, int number2);
BOOLEAN ForeignDigits(int number);
void PrintMatrix(void * ptr_mat, unsigned short col, unsigned short row, void print(void *));
void CopyChar(char * ch, char * copy);
void ResetMatrix(void * ptr_mat, unsigned short col, unsigned short row, void * type, void insert(void *, void *));
BOOLEAN CharInString(char text[], char c);
char * LastCharOfString(char * start_string);
unsigned int StringLength(char * str);
BOOLEAN StringCompare(char *start_stringA_index, char *start_stringB_index);
char * IndexCharInPointers(char *start_pointer, char *end_pointer , char c);
unsigned short CountCharInString(char *start_string_index, char *c);
void CutString(char *start_textA_index, char *end_textA_index, char *start_textB_index);
void CopyString(char *start_string_index, char *start_copy_index);
void LinkingString(char *start_stringA_index, char *start_stringB_index);
void ReverseString(char textA[]);
BOOLEAN StringBInStringA(char *start_string_a, char *start_string_b);
char * IndexStringBInStringA(char *start_string_a, char *start_string_b);
unsigned int CountStringBInStringA(char *start_string_a, char *start_string_b);
void RemoveStringBFromStringA(char *start_string_a, char *start_string_b);
void RemoveAllStringBFromStringA(char *start_stringA_index, char *start_stringB_index);
BOOLEAN ValidParenthesesTemplate(char text[]);
unsigned short CharToNumber(char *c);
unsigned int MaxCountCharInString(char *start_string_index);
void CopyPointers(char *start_string_index, char *start_copy_index, char *end_copy_index);
BOOLEAN EvenBits(byte b);
unsigned short CountBits(byte b);
void Multiply(float *ptr_number1, float *ptr_number2, double *ptr_result);
void InitStack(stack * sk);
BOOLEAN IsEmptyStack(stack * sk);
void PushStack(stack * sk , Data_Type item);
Data_Type PopStack(stack * sk);
void EmptyStack(stack * sk);
void CopyStack(stack * sk, stack * copy);
void OppositeStack(stack * sk);
BOOLEAN IsEqualsStack(stack * sk1, stack * sk2);
unsigned int ItemsStack(stack * sk);
int SumStack(stack * sk);
BOOLEAN FindNumberInStack(stack * sk, Data_Type item);
void UnionStack(stack * sk1, stack * sk2);
void InitQueue(queue * q);
void InsertQueue(queue * q, Data_Type item);
Data_Type RemoveQueue(queue * q); // Fix it
void InsertAfterList(LLL * manager);
void PushList(LLL ** manager);
void PopList(LLL ** manager);
void DeleteList(LLL * manager);
LLL * GetLoactionList(LLL ** manager, unsigned short location);
void PushDLLL(DLLL ** manager);
void InsertAfterDLLL(DLLL * ptr_before);
void InsertBeforeDLLL(DLLL * ptr_after);
void PopDLLL(DLLL ** manager);
void DeleteDLLL(DLLL * ptr_cur);
void InsertLastCLLL(CLLL ** manager);
void InsertAfterCLLL(CLLL * ptr_before);
void InsertEndCLLL(CLLL ** manager);
void DeleteLastCLLL(CLLL ** manager);
void DeleteAfterCLLL(CLLL * ptr_before);
void DeleteEndCLLL(CLLL ** manager);
void InsertLastCDLLL(CDLLL ** manager);
void InsertAfterCDLLL(CDLLL * ptr_before);
void InsertBeforeCDLLL(CDLLL * ptr_after);
void InsertEndCDLLL(CDLLL ** manager);
void DeleteCDLLL(CDLLL * ptr_cur);
void DeleteLastCDLLL(CDLLL ** manager);
// ---------------------------- Sparce Matrix ------------------------------
void InitSM(SM ** manager);
void AddRowSM(SM * manager);
void AddColSM(SM * manager);
SM * GetItemSM(SM * manager, int row, int col);
SM * FindAbove(SM * ptr_sm);
SM * FindBefore(SM * ptr_sm);
unsigned int RowsCountSM(SM * manager);
unsigned short ColsCountSM(SM * manager);
void AddItemSM(SM * manager, int row, int col);
void RemoveItemSM(SM * manager, int row, int col);
void RemoveColSM(SM * manager);
void RemoveRowSM(SM * manager);
void PrintIntDataType(Data_Type dt);
void PrintSM(SM * manager, void print(Data_Type));

BIN
22- recorstion2/a.out Normal file
View File

Binary file not shown.

27
22- recorstion2/ex1.c Normal file
View File

@@ -0,0 +1,27 @@
#include "General.h"
//---------------------------------------------------------------------------------------
// StringLength
// ------------
//
// General : Checks the length of string.
//
// Parameters :
// str - a pointer of string (char *)
//
// Return value : The length of string (unsigned int).
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 30.12.2019
//---------------------------------------------------------------------------------------
unsigned int StringLength(char * str)
{
return ((!*str) ? ZERO : (StringLength(++str) + ONE));
}
void main(void)
{
}

39
22- recorstion2/ex2.c Normal file
View File

@@ -0,0 +1,39 @@
#include "General.h"
//---------------------------------------------------------------------------------------
// Akeltoni
// --------
//
// General : Gets a string and arranges it "Akeltoni".
//
// Parameters :
// str_start - a pointer of string (char *)
//
// Return value : None.
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 30.12.2019
//---------------------------------------------------------------------------------------
void Akeltoni(char * str_start)
{
unsigned int str_len;
string new_string;
if (*str_start)
{
CopyString(new_string, ++str_start);
str_len = StringLength(new_string);
*str_start = *(new_string + str_len - ONE);
*(new_string + str_len - ONE) = BACKSLASH_ZERO;
CopyString(++str_start, new_string);
Akeltoni(str_start);
}
}
void main(void)
{
string test = "ABCDEFGH";
Akeltoni(test);
printf("%s\n", test);
}

34
22- recorstion2/ex3.c Normal file
View File

@@ -0,0 +1,34 @@
#include "General.h"
#define ASCII_ZERO '0'
#define ASCII_NINE '9'
//---------------------------------------------------------------------------------------
// EvenPlaceIsDigit
// ----------------
//
// General : Checks whether all characters in the pairing are digits.
//
// Parameters :
// str - a pointer of string (char *)
//
// Return value : If all characters in the pairing are digits.
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 30.12.2019
//---------------------------------------------------------------------------------------
BOOLEAN EvenPlaceIsDigit(char * str)
{
if (!(*str) || !(*(str - ONE)))
return (TRUE);
else
return (EvenPlaceIsDigit(str + TWO) * (ASCII_ZERO <= (*str) && ASCII_NINE >= (*str)));
}
void main(void)
{
}

32
22- recorstion2/ex5.c Normal file
View File

@@ -0,0 +1,32 @@
#include "General.h"
#define ASCII_A 'A'
//---------------------------------------------------------------------------------------
// CountAChar
// ----------
//
// General : Count the amount of characters that are A in string.
//
// Parameters :
// str - a pointer of string (char *)
//
// Return value : Count the amount of characters that are A in string (unsigned int).
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 30.12.2019
//---------------------------------------------------------------------------------------
unsigned int CountAChar(char * str)
{
if (!(*str))
return (ZERO);
else
return (CountAChar(++str) * ((*str) == ASCII_A));
}
void main(void)
{
}

35
22- recorstion2/ex6.c Normal file
View File

@@ -0,0 +1,35 @@
#include "General.h"
//---------------------------------------------------------------------------------------
// SubString
// ---------
//
// General : Checks whether the second string is a sub string in the first string.
//
// Parameters :
// first_str - first a pointer of string (char *)
// second_str - second a pointer of string (char *)
//
// Return value : if the second string is a sub string in the first string (BOOLEAN).
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 30.12.2019
//---------------------------------------------------------------------------------------
BOOLEAN SubString(char * first_str, char * second_str)
{
printf("s\n");
if (StringLength(first_str) < StringLength(second_str))
return (FALSE);
else
return (!StringCompare(second_str, first_str) ? (SubString(++first_str, second_str)) : TRUE);
}
void main(void)
{
string s1 = "ABCDEFG";
string s2 = "CD";
printf("%hu\n", SubString(s1, s2));
}

43
22- recorstion2/ex7.c Normal file
View File

@@ -0,0 +1,43 @@
#include "General.h"
#include <string.h>
//---------------------------------------------------------------------------------------
// StringMirror
// ------------
//
// General : Recursive function that receives a string and returns a mirror string
// of its inverted string. ("ABCD" = "DCBAABCD")
//
// Parameters :
// str - a pointer of string (char *)
//
// Return value : mirror string of its inverted string. (char *).
//
//---------------------------------------------------------------------------------------
// Programmer : Cohen Idan
// Student No : 211675038
// Date : 05.01.2019
//---------------------------------------------------------------------------------------
char * StringMirror(char * str)
{
string temp;
unsigned int len;
if (!(*(str + ONE)))
{
return (strcat(str, str));
}
else
{
temp[ZERO] = *str;
strcpy(temp + ONE, str);
len = StringLength(str) - ONE;
return (strcpy(StringMirror(str + ONE) + len, temp) - len);
}
}
void main(void)
{
string s1 = " nehoC nadI";
printf("%s\n", StringMirror(s1));
}