Loading repository data…

C-DataStructures-And-Algorithms GitHub Details, Stars and Alternatives | OpenRepoFinder

MostafaTwfiq / repository

C-DataStructures-And-Algorithms

Generic data structures and algorithms implemented in c language.

#algorithms#algorithms-c#algorithms-library#c#c-data-structures-and-algorithms#c-generic

View Repository on GitHub ↗

REPOSITORY OVERVIEW

Live repository statistics

★ 83Stars

⑂ 21Forks

◯ 1Open issues

◉ 83Watchers

79/100

OPENREPOHUB HEALTH SIGNAL

Healthy signals

A transparent discovery signal based on current public GitHub metadata.

Recent activity35% weight

100

Community adoption25% weight

Maintenance state20% weight

License clarity10% weight

100

Project information10% weight

This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.

README preview

C Data Structures And Algorithms

Generic
Unit tested
Terminating errors
Documented

General overview:

Implemented Data Structures

Trees

Red Black Tree
- Initialization
- Insertion
- Deletion
- Searching
- Contains
- Print
- Pre order traversal
- In order traversal
- Post order traversal
- Get Size
- Is Empty
- Transform to array
- Clear
- Destroy
AVL Tree
- Initialization
- Insertion
- Deletion
- Searching
- Contains
- Pre order traversal
- In order traversal
- Post order traversal
- Breadth first traversal
- Get Size
- Is Empty
- Transform to array
- Clear
- Destroy
Binary Tree
- Initialization
- Insertion
- Deletion
- Searching
- Contains

ALGORITHMICALLY RELATED

Similar Open-Source Projects

Selected from shared topics, language and repository description—not editorial ratings.

snvc00 /

data-structures-and-algorithms-cpp

★ 0

Generic implementations of algorithms and data structures in C++.

15/100 health

Active repository

C++No license

⑂ 0 forks◯ 1 issuesUpdated Sep 25, 2020

View details View on GitHub ↗

jessicadev-eng /

data-structures-algorithms-csharp

★ 0

C# implementation of core data structures and algorithms, including hashing, sorting and searching, generic linked lists, and a binary search tree, with unit testing using NUnit.

34/100 health

Active repository

C#No license

⑂ 0 forks◯ 0 issuesUpdated Jan 16, 2026

View details View on GitHub ↗

Function	Complexity	Comments
reverse array	O (n)
get most frequent value A	O (n ^ 2)	this function will use a resizable array to store the repeated values
get most frequent value H	O (n)	this function will use a hash map to store the repeated values
print array	O (n)	this function will need a helper printing function
resize array	O (n)
array resize and copy	O (n)	this function will allocate a new array with the new length and then it will copy the values in the original array into the new one
array resize and copy of range	O (k) and k is the length of the copying range	this function will allocate a new array with the new length and then it will copy the values between the provided into the new array
array copy	O (n)	this function will allocate a new array then it will copy the values in the original array into the new one
array copy of range	O (k) and k is the length of the copying range	this function will allocate a new array then it will copy the values between the provided range into the new array
fill array	O (n)
fill array in range	O (k) and k is the length of the range
compare arrays	O (n)
compare arrays in range	O (k) and k is the length of the range
array mismatch	O (n)
array mismatch in range	O (k) and k is the length of the range
array anagrams S	O (n log(n))	this function will sort the array first to determine if they are equals
array anagrams H	O (n)	this function will use a hash map the compare the arrays
array remove duplicates A	O (n ^ 3)	this function will use a resizable array to detect the duplicates
array remove duplicates H	O (n ^ 2)	this function will use a hash map to detect the duplicates
array count values	O (n)
is sub array	O (n ^ 2)
array get index	O (n)
array contains	O (n)
array remove at index	O (n)
array sort	O (n log(n))	this function will use quick sort algorithm to sort the array, note that quick sort complexity can be O (n ^ 2)
array get first	O (n)
array get last	O (n)
array get all	O (n)
array binary search	O (log(n))
array is palindrome	O (n)
array is rotation of an array	O (n)
array update element	O (1)
array add	O (n)
array add all	O (n)
array swap two indices	O (1)

Function	Complexity	Comments
is sub string	O (n ^ 2)
reverse words	O (n)
custom trim start	O (n ^ 2)
trim start	O (n ^ 2)
custom trim end	O (n)
trim end	O (n)
custom trim	O (n ^ 2)
trim	O (n ^ 2)
contains	O (n)
remove character	O (n)
is integer	O (n)
is floating point	O (n)
sum characters ASCII	O (n)
hash char array	O (n)	this function actually will return the sum the the characters ASCII
generate char array	O (n)	this function will allocate a new char array then it will copy the original char array into the new one
generate char pointer	O (1)	this function will generate a char pointer to a character
is alphabet C	O (1)	this function will take a character value then it will check if it's an alphabet character
is alphabet	O (1)	this function will take a character pointer then it will check if it's an alphabet character
comparison function P	O (1)	this function will take two character pointers then it will compare there ASCII values
comparison function	O (1)	this function will take two character value then it will compare there ASCII values
split S	O (n)	this function will split the char array into s

C-DataStructures-And-Algorithms

Live repository statistics

Healthy signals

README preview

C Data Structures And Algorithms

Implemented Data Structures

Trees

Similar Open-Source Projects

data-structures-and-algorithms-cpp

data-structures-algorithms-csharp

Graphs

Tables

Strings

Lists

Matrices

Pairs

Stacks

Queues

Deque

Implemented Algorithms

Arrays Algorithms

Char Array Algorithms