Giter Club home page Giter Club logo

princeton-algorithms's Introduction

Princeton-Algorithms

Code (in Java) for Princeton-Algorithms.

ps. p = examples, e = exercises, cp = creative problems, we = web exercises;

Ch3.Searching

3.3 Balanced Search Trees

# Code Summary
example RedBlackTree implementation of symbol table based on red-black BST

3.2 Binary Search Tree

# Code Summary
example BST implementation of symbol table using binary search tree(BST)

3.1 Symbol Tables

# Code Summary
exercises 2 Array_ST implementation of symbol table based on array
exercises 1 GPA using symbol table to calculate the total GPA of list of grades

Ch2.Sorting

2.4 Priority Queues

# Code Summary
example Heap implementation of heap andheap-sort

2.3 Quicksort

# Code Summary
example QuickSort implementation of quick-sort

2.2 Mergesort

# Code Summary
example MergeSort implementation of merge-sort, including top-down & buttom-up

2.1 Elementary Sorts

# Code Summary
creative problems 22 sort_transactions an application of sort
example VisualSort visualization of sorting process
example Sort implementation of selection-sort, insertion-sort and shell-sort

Ch1.Fundamentals

1.5 Union-Find

# Code Summary
web exercises dragon_balls use union-find to solve dragon_balls problem (HDOJ 3635)
web exercises how_many_tables use union-find to solve how many tables problem (HDOJ 1213)
example UF union-find class based on weight quick-union with path compression

1.4 Analysis of Algorithms

# Code Summary
creative problems 18,19 local_minimum find the local minimum for array or matrix
example TwoSum use binary search to make it faster for 2-Sum problem
example Stopwatch get the run time of program

1.3 Bags, Queues, Stacks

# Code Summary
creative problems 37 josephus_problem use queue (linked-list) to solve the Josephus problem
exercises 5 print_binary use stack to get the binary of an integer
exercises 4 parentheses use stack to check parentheses form
exercises 1 fixed_capacity_stack build a fixed capacity stack
example Bag use bag class to implement linked-list
example Stack use stack class to implement linked-list
example Queue use queue class to implement linked-list
example Reverse use stack to operate an array of numbers
example Stats use bag to operate a set of numbers

1.2 Data Abstraction

# Code Summary
exercises 1 Point2D find the distence of the closest pair of 2D points.

princeton-algorithms's People

Contributors

pnyuan avatar

Stargazers

avatar

Watchers

avatar avatar

Forkers

jamesliao2016

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.