This paper discusses a jet algorithm for hadron collisions that is similar to those used in $ e^{+}e^{-} $ collisions. The algorithm is based on the successive combination method, which recursively groups particles with nearby momenta into jets. It is compared to the cone algorithm, which defines jets based on angular separation from a central axis. The successive combination algorithm is shown to produce jets with similar properties to the cone algorithm, but with a different definition of jet boundaries. The algorithm is infrared safe, meaning it is not sensitive to long-distance effects. It is also shown that the successive combination algorithm may have advantages over the cone algorithm in terms of handling overlapping jets and reducing higher-order perturbative corrections. The paper concludes that the successive combination algorithm is not necessarily better than the cone algorithm, but it is a viable alternative for inclusive jet measurements in hadron collisions.This paper discusses a jet algorithm for hadron collisions that is similar to those used in $ e^{+}e^{-} $ collisions. The algorithm is based on the successive combination method, which recursively groups particles with nearby momenta into jets. It is compared to the cone algorithm, which defines jets based on angular separation from a central axis. The successive combination algorithm is shown to produce jets with similar properties to the cone algorithm, but with a different definition of jet boundaries. The algorithm is infrared safe, meaning it is not sensitive to long-distance effects. It is also shown that the successive combination algorithm may have advantages over the cone algorithm in terms of handling overlapping jets and reducing higher-order perturbative corrections. The paper concludes that the successive combination algorithm is not necessarily better than the cone algorithm, but it is a viable alternative for inclusive jet measurements in hadron collisions.