balajiathreya/inversion_counting balajiathreya/inversion_counting

  • Stars
    star
    1
  • Language
    Java
  • Created almost 12 years ago
  • Updated almost 12 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
balajiathreya/inversion_counting
github

balajiathreya

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

inversion counting using DC - CS 325 HW

More Repositories

1

twitterhelper

A backend for http://twitterhelper.balajiathreya.com. Contains services accessing Twitter api
Python
2
star
2

trimethelper

Uses Trimet developer API and Twitter API to track Trimet delays and arrivals in real-time
Python
1
star
3

MSCodingChallenge

Bunch of coding challenges from MS
Scala
1
star
4

personalwebsite

Source code for my personal website
Makefile
1
star
5

data-gov-in

Visualization of data from data.gov.in
JavaScript
1
star
6

tweetmap

Pick a location on the map and see trending topics near that location
JavaScript
1
star
7

trimetdashboard

Trimet Dashboard - a dashboard built using angular js displaying arrivals at my favorite TRIMET location ids
JavaScript
1
star
8

GAEApp

1
star
9

ProjectEuler

Project Euler problems using scala
Scala
1
star
10

TSP

Travelling Sales Man
Java
1
star
11

dijkstra-s-algorithm-in-perl

dijkstra's algorithm in perl - output requires some formatting though
Perl
1
star
12

mp3_tag_reader

A python util that reads audio tags from audio files, creates folders for each album and moves the files to the album folders. The mp3 player in Galaxy Nexus sucks when it comes to identifying mp3 tags
Python
1
star
13

CS-311

code for operating systems projects CS 311
C
1
star
14

SortingAlgorithms

Sorting algorithms in java
Java
1
star
15

maximum_subarray_problem

Maxium sub array probelm using BF,DP and DC. HW for CS 325
Java
1
star
16

SimpleDatabase

Java
1
star
17

dailyprogrammer

One problem to be solved every day.
Java
1
star
18

analog-clock-time-rotation

a java program that computes the number of rotation needed so that 2 analog clocks have the same time.
Java
1
star
19

CrackingTheCodeInterview

Solution for problems from Cracking the code interview, 4th edition
Java
1
star
20

BTreeSortingValidator

A B-tree is a generalization of a binary search tree, where each node has n keys and n+1 children and n can be different for each node. The keys are sorted the same as in a binary search tree. For each key k in the tree, all children to the left must have keys less than k, and all children to the right must have keys greater than k. Write a method that validates whether a B-tree is correctly sorted. You do NOT need to validate whether the tree is balanced. Use the following model for a node in the B-tree.
Java
1
star
21

Prim-s-algorithm

Implementation of Prim's algorithm in 3 flavors - serial, pthreads and C++ AMP
C
1
star