{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T20:40:02Z","timestamp":1747255202539,"version":"3.40.5"},"publisher-location":"New Delhi","reference-count":12,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132222194"},{"type":"electronic","value":"9788132222200"}],"license":[{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-81-322-2220-0_28","type":"book-chapter","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T08:00:18Z","timestamp":1419321618000},"page":"357-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Earthquake Data Sorting with Minimum Swap Operations"],"prefix":"10.1007","author":[{"given":"S.","family":"Kumar","sequence":"first","affiliation":[]},{"given":"R.","family":"Sushil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,24]]},"reference":[{"key":"28_CR1","unstructured":"Alfred, V., Aho, J., Horroroft., Jeffrey, D.U.: Data structures and algorithms. Pearson Education Asia, India (2002)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yu, P., Gan, Y.: Experimental study on the five sort algorithms. In: IEEE 2nd International Conference on Mechanic Automation and Control Engineering (MACE), pp. 1314\u20131317, ISBN: 978-1-4244-9436-1, IEEE explore digital library (2011)","DOI":"10.1109\/MACE.2011.5987184"},{"key":"28_CR3","unstructured":"Beniwal, S., Grover, D.: Int. J. Emerg Res Manage. Technol. ISSN: 2278-9359, Vol. 2(5) (2013)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.amc.2007.01.019","volume":"190","author":"A Kumari","year":"2007","unstructured":"Kumari, A., Chakraborty, S.: Software complexity: A statistical case study through insertion sort. Appl. Math. Comput. 190(1), 40\u201350 (2007)","journal-title":"Appl. Math. Comput."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Jafarlou, M.Z., Fard, P.Y.: Heuristic and pattern based merge sort. In: Proceedings Computer Science, World conference on IT, vol. 3, pp. 322\u2013324, Elsevier publication, Amsterdam (2011)","DOI":"10.1016\/j.procs.2010.12.055"},{"issue":"5","key":"28_CR6","first-page":"909","volume":"5","author":"H Iraj","year":"2006","unstructured":"Iraj, H., Afsari, M.H.S., Hassanzadeh, S.: A new external sorting algorithm with selecting the record list location. USEAS Trans. Commun. 5(5), 909\u2013913 (2006)","journal-title":"USEAS Trans. Commun."},{"key":"28_CR7","volume-title":"Data structures and algorithms in Java","author":"R Lafore","year":"2002","unstructured":"Lafore, R.: Data structures and algorithms in Java, 2nd edn. SAMS Publishing, Indianapolis (2002)","edition":"2"},{"key":"28_CR8","unstructured":"Robert, S.: Algorithms in C. Addison-Wesley Publishing Company, Inc., Reading (1998)"},{"key":"28_CR9","unstructured":"Knuth, E.: The art of computer programming sorting and searching. Addison Wesley, Reading (1998)"},{"key":"28_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2003","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT, Cambridge (2003)","edition":"2"},{"key":"28_CR11","unstructured":"Lipschutz, S.: Data structure with C. Tata McGraw-Hill Education, New Delhi (2009)"},{"issue":"5","key":"28_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0020-0190(00)00223-4","volume":"79","author":"B Brejova","year":"2001","unstructured":"Brejova, B.: Analyzing variants of shell sort. Inf. Process. Lett. 79(5), 223\u2013227 (2001)","journal-title":"Inf. Process. Lett."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Fourth International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2220-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T20:01:17Z","timestamp":1747252877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-2220-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,24]]},"ISBN":["9788132222194","9788132222200"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2220-0_28","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014,12,24]]},"assertion":[{"value":"24 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}