Algorithms and ADTs • binary search algorithm • conditions necessary for the use of a binary search • performance of a binary search • implement an insertion sort • implement a bubble sort • performance of a sort routine • find an item in : linked list, binary tree, hash table • insert an item: stack, queue, linked list, binary tree, hash table …

The "Java Data Structures and Algorithms Repository" is a curated collection of well-organized Java code for sorting, searching, linked lists, and stacks. It's a valuable resource for developers seeking to enhance their skills in data structures and algorithms.

Stack Array and operations like: enque(), peek(), pop()

Estudo de estruturas de dados: implementação de algoritmo de pilhas (e suas operações pop, push e peek) com vetor e lista simplesmente ligada em C.

Stack array and linked list implementations

All common Data Structures are implemented in Java from scratch, without using any predefined JDK classes.

This project implements a stack using function pointers in C to simulate polymorphism. The stack supports common operations such as push, pop, top and so on.