Sorting in dynamic stack using linked list





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}







1















I am stuck in sorting really want a code that can sort my dynamic stack i am posting my code if anyone can help me provide me code for sorting according to my code.



class Node
{
public int info; //incoming data
public Node link; //reference of next value

public Node(int i)
{
info = i;
link = null;
}
}

class DynamicStack
{
private Node start;
public DynamicStack()
{
start = null;
}
public void Push(int data)
{
Node temp = new Node(data);
temp.link = start;
start = temp;
}
public void CreateStack()
{
int i, n, data;
Console.Write("Enter the number of nodes : ");
n = Convert.ToInt32(Console.ReadLine());
if (n == 0)
return;
for (i = 1; i <= n; i++)
{
Console.Write("Enter the element to be inserted : ");
data = Convert.ToInt32(Console.ReadLine());
Push(data);
}
}
public void Pop()
{
if (start == null)
return;
start = start.link;
}


By using these methods i can push and pop my values in list but stuck in sorting those inserted values just need a code which can work with my code and sort my values.










share|improve this question























  • Possible duplicate of Merge Sort a Linked List

    – bunglehead
    Nov 25 '18 at 11:30


















1















I am stuck in sorting really want a code that can sort my dynamic stack i am posting my code if anyone can help me provide me code for sorting according to my code.



class Node
{
public int info; //incoming data
public Node link; //reference of next value

public Node(int i)
{
info = i;
link = null;
}
}

class DynamicStack
{
private Node start;
public DynamicStack()
{
start = null;
}
public void Push(int data)
{
Node temp = new Node(data);
temp.link = start;
start = temp;
}
public void CreateStack()
{
int i, n, data;
Console.Write("Enter the number of nodes : ");
n = Convert.ToInt32(Console.ReadLine());
if (n == 0)
return;
for (i = 1; i <= n; i++)
{
Console.Write("Enter the element to be inserted : ");
data = Convert.ToInt32(Console.ReadLine());
Push(data);
}
}
public void Pop()
{
if (start == null)
return;
start = start.link;
}


By using these methods i can push and pop my values in list but stuck in sorting those inserted values just need a code which can work with my code and sort my values.










share|improve this question























  • Possible duplicate of Merge Sort a Linked List

    – bunglehead
    Nov 25 '18 at 11:30














1












1








1








I am stuck in sorting really want a code that can sort my dynamic stack i am posting my code if anyone can help me provide me code for sorting according to my code.



class Node
{
public int info; //incoming data
public Node link; //reference of next value

public Node(int i)
{
info = i;
link = null;
}
}

class DynamicStack
{
private Node start;
public DynamicStack()
{
start = null;
}
public void Push(int data)
{
Node temp = new Node(data);
temp.link = start;
start = temp;
}
public void CreateStack()
{
int i, n, data;
Console.Write("Enter the number of nodes : ");
n = Convert.ToInt32(Console.ReadLine());
if (n == 0)
return;
for (i = 1; i <= n; i++)
{
Console.Write("Enter the element to be inserted : ");
data = Convert.ToInt32(Console.ReadLine());
Push(data);
}
}
public void Pop()
{
if (start == null)
return;
start = start.link;
}


By using these methods i can push and pop my values in list but stuck in sorting those inserted values just need a code which can work with my code and sort my values.










share|improve this question














I am stuck in sorting really want a code that can sort my dynamic stack i am posting my code if anyone can help me provide me code for sorting according to my code.



class Node
{
public int info; //incoming data
public Node link; //reference of next value

public Node(int i)
{
info = i;
link = null;
}
}

class DynamicStack
{
private Node start;
public DynamicStack()
{
start = null;
}
public void Push(int data)
{
Node temp = new Node(data);
temp.link = start;
start = temp;
}
public void CreateStack()
{
int i, n, data;
Console.Write("Enter the number of nodes : ");
n = Convert.ToInt32(Console.ReadLine());
if (n == 0)
return;
for (i = 1; i <= n; i++)
{
Console.Write("Enter the element to be inserted : ");
data = Convert.ToInt32(Console.ReadLine());
Push(data);
}
}
public void Pop()
{
if (start == null)
return;
start = start.link;
}


By using these methods i can push and pop my values in list but stuck in sorting those inserted values just need a code which can work with my code and sort my values.







sorting linked-list






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 25 '18 at 11:20









Mashood RehanMashood Rehan

61




61













  • Possible duplicate of Merge Sort a Linked List

    – bunglehead
    Nov 25 '18 at 11:30



















  • Possible duplicate of Merge Sort a Linked List

    – bunglehead
    Nov 25 '18 at 11:30

















Possible duplicate of Merge Sort a Linked List

– bunglehead
Nov 25 '18 at 11:30





Possible duplicate of Merge Sort a Linked List

– bunglehead
Nov 25 '18 at 11:30












0






active

oldest

votes












Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53466925%2fsorting-in-dynamic-stack-using-linked-list%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53466925%2fsorting-in-dynamic-stack-using-linked-list%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







這個網誌中的熱門文章

Hercules Kyvelos

Tangent Lines Diagram Along Smooth Curve

Yusuf al-Mu'taman ibn Hud