Data Structures - Tutorials & Examples

Data Structures and Algorithm Analysis in Java

Delve into the fundamentals of data structures and algorithms with Data Structures and Algorithm Analysis in Java. This comprehensive guide focuses on performance optimization, scalability, and real-world Java implementations. From sorting to dynamic programming, it equips developers with the tools to build efficient, high-performance applications. A must-read for students and professionals seeking to master Java’s capabilities in solving complex computational problems.

Java Program to Show Stack Implementation

Stack Implementation with Array

This java code implements stack functionality by using arrays. It can Pop and Push an item in stack with the help of array. The item can only be an integer number and internally the java program uses arrays to maintain items in stack.

Data Structures Java Source Code

Stack Implementation in C

This is a C program that simulates stack operations graphically and in text mode. The program uses linked list to

C Programming Data Structures Graphics

Bayer Tree implementation in C

This is implementation of Bayer-Trees, which are normally used for indices of data bases. These routines provide all stuff that is needed to create and destroy; insert, update and delete; load and destroy; search and traverse; check a tree. Sort huge amounts of data by doing a multi-phase sorting on temporary files.

Algorithms C Programming Data Structures Utilities

Fundamentals of data structures

This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem solving,

Books Data Structures

Sort Huge amount of data using C Programming Language

The big sort routine implements a way to sort huge amounts of data using C programming language. It sorts the data that do not fit into main memory by using a multi-phase sorting on files. It is a implementation from the book “Algorithms and data structures” by Niklaus Wirth. Additionally, this routine recognizes small amounts of data that do fit into memory and resorts to a in-place quicksort.

Algorithms Data Structures Sorting

Data Structure Library

Ubiqx is a collection of ANSI C compatible modules for implementing linked lists, binary trees, caching and spare arrays. The goal of the ubiqx project is to develop a set of clean, small, re-usable code modules which implement fundamental constructs and mechanisms, and to make them available under the terms of the GNU Library General Public License (LGPL).

C Programming Data Structures