Skip to main content

Greedy Algorithms in JAVA


  • Sorting
  • huffman coding compression algo
  • prims algorithm
  • kruskal algorithm
  • dijkstra algorithm
  • coin change problem
  • fractional knapsack
  • disjoint sets

Comments

.

Popular posts from this blog

Nth Node from End in LinkedList

Nth Node from End in LinkedList 1)  Find length of  linked list. 2) Traverse (length-position+1) element from begin. //nth Node from end public Node nodeFromEnd ( Node head , int position ){ Node temp = head ; int length = 1 ; while ( temp . next != null ) { length ++; temp = temp . next ; } System . out . println ( "length" + length ); temp = head ; int c = 1 ; while ( c !=( length - position + 1 )) { temp = temp . next ; c ++; } return temp ; }