StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
20082977
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-11-19T22:00:19.043
FavoriteCount
0
LastActivityDate
2013-11-19T22:16:30.240
LastEditDate
2013-11-19T22:16:30.240
LastEditorUserId
1490962
OwnerUserId
1490962
ParentId
20082266
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
You should use own implemented sorting method. For this you also need to learn ArryList class methods for swaping values. You'll have to use get(int) and set(int, E) extensively to swap elements. I am showing you one solution that I like to do when Collections.Sort is not feasible. In this I am using "Bubble Sort" sorting method. I hope you are aware from "Bubble Sort".. package online.solution; <pre><code>import java.util.ArrayList; public class Node { private String key; private int x; public Node(String key, int x) { this.key = key; this.x = x; } public int getX() { return x; } public static void main(String[] args) { Node n1 = new Node("B", 14); Node n2 = new Node("H", 7); Node n3 = new Node("U", 13); Node n4 = new Node("S", 1); Node n5 = new Node("H", 88); Node n6 = new Node("A", 99); Node n7 = new Node("N", 12); ArrayList<Node> nodes = new ArrayList<>(); nodes.add(n1); nodes.add(n2); nodes.add(n3); nodes.add(n4); nodes.add(n5); nodes.add(n6); nodes.add(n7); System.out.println("Before sorting..."); for (Node node : nodes) { System.out.println(node.getX()); } int n, i, j; Node swap; n = nodes.size(); for (i = 0; i < (n - 1); i++) { for (j = 0; j < n - i - 1; j++) { if (nodes.get(j).getX() > nodes.get(j + 1).getX()) { swap = nodes.get(j); nodes.set(j, nodes.get(j + 1)); nodes.set(j + 1, swap); } } } System.out.println("After sorting in Ascending Order..."); for (Node node : nodes) { System.out.println(node.getX()); } for (i = 0; i < (n - 1); i++) { for (j = 0; j < (n - i - 1); j++) { if (nodes.get(j).getX() < nodes.get(j + 1).getX()) { swap = nodes.get(j); nodes.set(j, nodes.get(j + 1)); nodes.set(j + 1, swap); } } } System.out.println("After sorting in Descending Order ..."); for (Node node : nodes) { System.out.println(node.getX()); } } } </code></pre> I hope this solution help you in your work... <img src="https://i.stack.imgur.com/YjzyS.jpg" alt="enter image description here">
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow do you sort an ArrayList
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USBhushankumar Lilapara
UserOwnerUserId
1. USBhushankumar Lilapara
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.