Group items tagged

Textbook. The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne [ Amazon · Pearson · InformIT ] surveys the most important algorithms and data structures in use today. The textbook is organized into six chapters: Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model. Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also includes a binary heap implementation of a priority queue. Chapter 3: Searching describes several classic symbol table implementations, including binary search trees, red-black trees, and hash tables. Chapter 4: Graphs surveys the most important graph processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths. Chapter 5: Strings investigates specialized algorithms for string processing, including radix sorting, substring search, tries, regular expressions, and data compression. Chapter 6: Context highlights connections to systems programming, scientific computing, commercial applications, operations research, and intractability.

"From an algorithms perspective, this is a great time to be alive. Algorithms are just frolicking in the mountains of data that they can play with."

A YouTube channel dedicated to folk dancing and sorting algorithms. The video above is a shell-sort with Hungarian folk dance.

Some people just cannot seem to learn what it means when Google says "We made 400+ algorithm changes last year!"

At the heart of the hash table algorithm is a simple array of items; this is often simply called the hash table. Hash table algorithms calculate an index from the data item's key and use this index to place the data into the array.

Google Plus has a really nice image gallery. They somehow managed to display all the photos without cropping, without reordering and without any holes. We are going to see how they did it in this blog post.

In computer science, a binary search or half-interval search algorithm locates the position of an item in a sorted array

Good video to show when teaching algorithm development.

"In 2013, Google Code Jam will mark its tenth year of bringing the world's coding community together to solve tough algorithmic puzzles. Last year tens of thousands competed, but there could only be one Code Jam Champion: Poland's Jakub Pachocki (meret), who took home the title and the first prize of $10,000."

"Introduction to the intellectual enterprises of computer science and the art of programming. This course teaches students how to think algorithmically and solve problems efficiently."

Welcome to the Programming Dojo. This is a place where you can learn more about programming and programming languages. Programming is both an art and a science. It involves interpretation, abstraction and creation, as well as quantitive analysis, mathematics and algorithmic thinking. Don't expect too much too quickly. Just like many things in life, good things take time.

A new version of the dangerous GpCode ransomware has been detected, using RSA-1024 and AES-256 as crypto-algorithms.

Computer Science Unplugged is a series of learning activities that reveals a little-known secret: Computer Science isn't really about computers at all! CS Unplugged provides an extensive collection of free resources that teach principles of Computer Science such as binary numbers, algorithms and data compression through engaging games and puzzles that use cards, string, crayons and lots of running around.

This is an example of building a tree layout using the Reingold-Tilford "tidy" algorithm, as described in "Tidier Drawings of Trees". As each new element is added to the graph, it animates in, starting at the previous position of the parent node. Thus, the existing nodes and the new node transition smoothly to their new positions. The animation stops when 500 nodes have been added to the tree.