data structures : quicksort linkedList with java
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty height:90px;width:728px;box-sizing:border-box;
0
is there a way to get the same result when using LinkedList rather than an array? The following code works perfectly, only when Im using array in its generics form. I want to do the same by using LinkedList. so something like this :
public static <E extends Comparable<E>> LinkedList<E> qSort(LinkedList<E> list)
return list;
this is what I already have..
public static <E extends Comparable<E>> E quickSort(E list)
if (list.length <= 1)
return list;
sort(list, 0, list.length - 1);
return list;
public static <E extends Comparable<E>> void sort(E list, int low, int high)
if ((high - low) <= 0)
return;
int splitPoint = split(list, low, high);
sort(list, low, splitPoint - 1);
sort(list, splitPoint + 1, high);
private static <E extends Comparable<E>> int split(E list, int low, int high)
int left = low + 1;
int right = high;
E pivot = list[low];
while (left <= right)
if (list[left].compareTo(pivot) < 0)
left++;
else
break;
while (true)
while (right > left)
if (list[right].compareTo(pivot) < 0)
break;
else
right--;
if (left >= right)
break;
E temp = list[left];
list[left] = list[right];
list[right] = temp;
left++;
right--;
list[low] = list[left -1];
list[left-1] = pivot;
return left-1;
java data-structures quicksort
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
|
show 2 more comments
0
is there a way to get the same result when using LinkedList rather than an array? The following code works perfectly, only when Im using array in its generics form. I want to do the same by using LinkedList. so something like this :
public static <E extends Comparable<E>> LinkedList<E> qSort(LinkedList<E> list)
return list;
this is what I already have..
public static <E extends Comparable<E>> E quickSort(E list)
if (list.length <= 1)
return list;
sort(list, 0, list.length - 1);
return list;
public static <E extends Comparable<E>> void sort(E list, int low, int high)
if ((high - low) <= 0)
return;
int splitPoint = split(list, low, high);
sort(list, low, splitPoint - 1);
sort(list, splitPoint + 1, high);
private static <E extends Comparable<E>> int split(E list, int low, int high)
int left = low + 1;
int right = high;
E pivot = list[low];
while (left <= right)
if (list[left].compareTo(pivot) < 0)
left++;
else
break;
while (true)
while (right > left)
if (list[right].compareTo(pivot) < 0)
break;
else
right--;
if (left >= right)
break;
E temp = list[left];
list[left] = list[right];
list[right] = temp;
left++;
right--;
list[low] = list[left -1];
list[left-1] = pivot;
return left-1;
java data-structures quicksort
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
Unless this is a programming exercise, why not just useCollections.sort(List<T>)?
– MTCoster
Nov 16 '18 at 12:39
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56
|
show 2 more comments
0
0
0
is there a way to get the same result when using LinkedList rather than an array? The following code works perfectly, only when Im using array in its generics form. I want to do the same by using LinkedList. so something like this :
public static <E extends Comparable<E>> LinkedList<E> qSort(LinkedList<E> list)
return list;
this is what I already have..
public static <E extends Comparable<E>> E quickSort(E list)
if (list.length <= 1)
return list;
sort(list, 0, list.length - 1);
return list;
public static <E extends Comparable<E>> void sort(E list, int low, int high)
if ((high - low) <= 0)
return;
int splitPoint = split(list, low, high);
sort(list, low, splitPoint - 1);
sort(list, splitPoint + 1, high);
private static <E extends Comparable<E>> int split(E list, int low, int high)
int left = low + 1;
int right = high;
E pivot = list[low];
while (left <= right)
if (list[left].compareTo(pivot) < 0)
left++;
else
break;
while (true)
while (right > left)
if (list[right].compareTo(pivot) < 0)
break;
else
right--;
if (left >= right)
break;
E temp = list[left];
list[left] = list[right];
list[right] = temp;
left++;
right--;
list[low] = list[left -1];
list[left-1] = pivot;
return left-1;
java data-structures quicksort
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
is there a way to get the same result when using LinkedList rather than an array? The following code works perfectly, only when Im using array in its generics form. I want to do the same by using LinkedList. so something like this :
public static <E extends Comparable<E>> LinkedList<E> qSort(LinkedList<E> list)
return list;
this is what I already have..
public static <E extends Comparable<E>> E quickSort(E list)
if (list.length <= 1)
return list;
sort(list, 0, list.length - 1);
return list;
public static <E extends Comparable<E>> void sort(E list, int low, int high)
if ((high - low) <= 0)
return;
int splitPoint = split(list, low, high);
sort(list, low, splitPoint - 1);
sort(list, splitPoint + 1, high);
private static <E extends Comparable<E>> int split(E list, int low, int high)
int left = low + 1;
int right = high;
E pivot = list[low];
while (left <= right)
if (list[left].compareTo(pivot) < 0)
left++;
else
break;
while (true)
while (right > left)
if (list[right].compareTo(pivot) < 0)
break;
else
right--;
if (left >= right)
break;
E temp = list[left];
list[left] = list[right];
list[right] = temp;
left++;
right--;
list[low] = list[left -1];
list[left-1] = pivot;
return left-1;
java data-structures quicksort
java data-structures quicksort
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
edited Nov 16 '18 at 12:48
Jamy Zwiss
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
asked Nov 16 '18 at 12:37
Jamy ZwissJamy Zwiss
12
12
Unless this is a programming exercise, why not just useCollections.sort(List<T>)?
– MTCoster
Nov 16 '18 at 12:39
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56
|
show 2 more comments
Unless this is a programming exercise, why not just useCollections.sort(List<T>)?
– MTCoster
Nov 16 '18 at 12:39
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56
Unless this is a programming exercise, why not just use
Collections.sort(List<T>)?– MTCoster
Nov 16 '18 at 12:39
Unless this is a programming exercise, why not just use
Collections.sort(List<T>)?– MTCoster
Nov 16 '18 at 12:39
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56
|
show 2 more comments
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53338055%2fdata-structures-quicksort-linkedlist-with-java%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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53338055%2fdata-structures-quicksort-linkedlist-with-java%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
Unless this is a programming exercise, why not just use
Collections.sort(List<T>)?– MTCoster
Nov 16 '18 at 12:39
please how can i apply it ?
– Jamy Zwiss
Nov 16 '18 at 12:49
Possible duplicate of stackoverflow.com/q/16252269/1813169
– MTCoster
Nov 16 '18 at 12:51
Possible duplicate of How to sort an ArrayList?
– MTCoster
Nov 16 '18 at 12:51
Do you want to implement the sorting algorith your self for linkedlist using quicksort?
– efex09
Nov 16 '18 at 12:56