#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/practice-problems/connect-sticks-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/practice-problems/connect-sticks-implementation

Repovive

Connect Sticks - Implementation - Practice Problems | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Connect Sticks - Implementation

The code

Here is the solution:

function connectSticks(sticks)
 heap := min-heap of sticks
 cost := 0
 while heap.size > 1
 a := heap.pop()
 b := heap.pop()
 merged := a + b
 cost := cost + merged
 heap.push(merged)
 return cost

Time: $O(n \log n)$ . Space: $O(n)$ .

A min-heap efficiently gives you the two smallest sticks. Merge them, add to cost, push the result back.