Abstract: With the deepening application of data sharing in smart grid,medical and other fields,the problem of privacy protection has become increasingly prominent.As an advanced theory of privacy protection,K-anonymity is widely used for data sharing and distribution.However,in the process of realizing K-anonymity mechanism,the generalization process of data will inevitably cause some information loss,so how to reduce information loss as much as possible and ensure data availability in the process of realizing K-anonymity is a problem worth studying.An anonymous algorithm based on sorting and dynamic programming（AASDP）was proposed. The tuples in the table were sorted based on the distance between tuples,and the optimal clustering partition satisfying the K-anonymity condition was found through dynamic programming to ensure the optimal availability of data after generalization.Theoretical and experimental analysis show that the proposed algorithm can minimize the loss of information and ensure polynomial time complexity.