CompleteGraphSort is a complete graph structure based new sorting algorithm

zbMATH Open1413.68026MaRDI QIDQ4614850FDOQ4614850

Authors: Rajat Kumar Pal 

Publication date: 31 January 2019

Full work available at URL: https://camo.ici.ro/journal/vol15/v15a11.pdf

Recommendations

• Sorting an array using the topological sort of a corresponding comparison graph
• scientific article; zbMATH DE number 3928360
• scientific article; zbMATH DE number 1827438
• Sorting with networks of data structures
• scientific article; zbMATH DE number 2219109

zbMATH Keywords

graphalgorithmcomplexitysortingsatellite datarecordcomparison sort

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cited In (3)

• 2 mm: a new technique for sorting data
• CompleteGraphSort
• Sorting an array using the topological sort of a corresponding comparison graph

Uses Software

• RKPianGraphSort

This page was built for publication: CompleteGraphSort is a complete graph structure based new sorting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614850)