The coordination paradigm improves the development of concurrent/distributed solutions, because it provides a simple way to communicate between processes via a data structure called a tuple space. Coordination principles and event-driven system development principles can be fruitfully combined to develop systems and to analyse the development of different solutions of a given problem. Benefits are inherited from both frameworks : the B event-driven approach provides the refinement and the coordination framework provides a simple computation model. The sorting problem is redeveloped in the B event-driven method using coordination principles for algorithms and two programming paradigms are applied ie merging and splitting list to sort.