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



Popular posts from this blog

Deleting a Node by passing data in LInkedList

Deleting a Node by passing data in LInkedList:-

The node can be deleted by passing the data value in a function.Here we have three pointers one to traverse the list other to point current node and third one to point previous of current node.

//deleting a given keypublic Node deleteKeyNode(Node head,int key){//traverse pointer Node temp=head;//previous pointer Node prevtemp=temp;while(temp!=null){//when key is at head positionif({; System.out.println("head is deleted");return head;}//when key is at any position other than headif({;; temp=prevtemp;} prevtemp=temp;;}return head;}