Algorithms
844 views | +0 today

# Algorithms

Curated by Arvind
 Scooped by Arvind

## Interesting Facts about Bitwise Operators in C - GeeksforGeeks

In C, following 6 operators are bitwise operators (work at bit-level) & (bitwise AND) Takes two numbers as operand and does AND on every bit of two numbers. The result of AND is 1 only if both bits are 1. | (bitwise OR) Takes two numbers as operand and does OR on every bit of …
No comment yet.
 Scooped by Arvind

## DaQwest | Algorithms Repository

No comment yet.
 Scooped by Arvind

## Range Minimum Query

RANGE QUERY Given a (big) array r[0..n-1], and a lot of queries of certain type. We may want to pre-process the data so that each query can be performed fast. In this section, we use T (f, g) to de...
Arvind's insight:

No comment yet.
 Scooped by Arvind

## Vazirani chap6.pdf

No comment yet.
 Scooped by Arvind

## Unit6-CM.pdf

No comment yet.
 Scooped by Arvind

## Intro to Algorithms: CHAPTER 16: DYNAMIC PROGRAMMING

No comment yet.
 Scooped by Arvind

## TopCoder Statistics - Problem Archive

No comment yet.
 Scooped by Arvind

## Dynamic Programming - Technical Collection

Technical Collection
Arvind's insight:

subpages:  Cutting a Rod Knapsack Problem Longest Common Subsequence Longest Increasing Subsequence Min jumps Palindrome Partitioning Partition Problem Two Glass Balls Ugly NumberWord Wrap Problem

No comment yet.
 Scooped by Arvind

## The Knuth-Morris-Pratt Algorithm in my own words - jBoxer

For the past few days, I’ve been reading various explanations of the Knuth-Morris-Pratt string searching algorithms. For some reason, none of...
No comment yet.
 Scooped by Arvind

## 2. Models of Computation, Document Distance - YouTube

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine License: Creative Commons BY-N...
Arvind's insight:

later part  has Document similarity algorithm

No comment yet.
 Scooped by Arvind

## Graph Algorithms Book

No comment yet.
 Scooped by Arvind

## Longest Common Subsequences

Arvind's insight:

see the Finite automata for nano.

see the argument used for number of distinct arguments

No comment yet.
 Scooped by Arvind

## Finding a Loop in a Singly Linked List

Discussion of algorithms that can be used to discover if a singly linked list data structure contains a loop.
No comment yet.
 Scooped by Arvind

## Diameter of a Binary Tree - GeeksforGeeks

The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two trees each with diameter nine, the leaves that form the ends of a longest path are shaded (note that there is more than one path in …
Arvind's insight:

see the diagram and the recurrence equation

No comment yet.
 Scooped by Arvind

## Data Structures and Algorithm

No comment yet.
 Scooped by Arvind

## Dynamic Programming Edit Distance

No comment yet.
 Scooped by Arvind

## chap11.pdf

Arvind's insight:

more inclined on "Math Optimization" side

No comment yet.
 Scooped by Arvind

## 04-dynamic-programming.pdf

No comment yet.
 Scooped by Arvind

## Chapter15.pdf

No comment yet.
 Scooped by Arvind

## Dynamic Programming Type - Codeforces

Codeforces. Programming competitions and contests, programming community
No comment yet.
 Scooped by Arvind

## The 0/1 Knapsack Problem - Dynamic Programming Method - YouTube

The Dynamic Programming method to solving the 0/1 Knapsack Problem. Note: I uploaded the wrong version cos I'm an idiot. There are three bugs. Bug 1: Ignore ...
No comment yet.
 Scooped by Arvind

## Min jumps - Technical Collection

Technical Collection
No comment yet.
 Scooped by Arvind

## Longest Common Subsequence - Technical Collection

Technical Collection
No comment yet.
 Scooped by Arvind

## 03-projetoalgoritmos.pdf

Arvind's insight:

Using Induction to design Algorithms - Manber

No comment yet.
 Scooped by Arvind

## Aho–Corasick string matching algorithm - Wikipedia, the free encyclopedia

#### Aho-Corasick string matching algorithm

In computer science, the Aho-Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the "dictionary") within an input text. It matches all patterns simultaneously.

Arvind's insight:

It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the "dictionary") within an input text. It matches all patterns simultaneously.

No comment yet.