Time and space efficient algorithm for consumer´s priority product management

In this highly competitive free market economy, the test or interest of a certain consumer plays a momentous role for the business organizations to select appropriate products to be advertised to him through the online store or their website. In other words, business organizations need to be proficient in advertising their products to attract the potential consumers. To achieve the goal, organizations have to keep track of the consumers´ buying habit to figure out the priority products. Thus the consumers´ priority product management is a candidate for high degree of attention. In this paper, we have developed and analyzed the algorithm for consumers´ priority product management with minimum time and space complexity. We use the concept of balanced binary search tree in this case to attain efficient time complexity. For reducing space requirement, we have proposed merging algorithm that incorporates with the balanced binary search tree, to achieve the optimal performances. We have simulated for 1 million test cases and our results show that the algorithm achieves a high memory saving index with logarithmic time complexity in each working round.