Hjdcti

How can I automatically replace [[ and ]] with the [LeftDoubleBracket] and [RightDoubleBracket] operators?

How do we improve the relationship with a client software team that performs poorly and is becoming less collaborative?

DOS, create pipe for stdin/stdout of command.com(or 4dos.com) in C or Batch?

What defenses are there against being summoned by the Gate spell?

Patience, young "Padovan"

Simple device (fancy) pointer implementation

Compute hash value according to multiplication method

Theorems that impeded progress

Why has Russell's definition of numbers using equivalence classes been finally abandoned? ( If it has actually been abandoned).

Pronouncing Dictionary.com's W.O.D "vade mecum" in English

Why Is Death Allowed In the Matrix?

Should I join office cleaning event for free?

How old can references or sources in a thesis be?

"which" command doesn't work / path of Safari?

Are tax years 2016 & 2017 back taxes deductible for tax year 2018?

How does one intimidate enemies without having the capacity for violence?

How to re-create Edward Weson's Pepper No. 30?

How to add power-LED to my small amplifier?

XeLaTeX and pdfLaTeX ignore hyphenation

Is there a familial term for apples and pears?

What is the offset in a seaplane's hull?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

What are these boxed doors outside store fronts in New York?

Continuity at a point in terms of closure

Possibly bubble sort algorithm

How can I speed up my shell sort?Stable Sort in C#Bubble sort a list of integers for a number of iterationsMerge Sort algorithmExact sort - sorting with few move operationsBubble Sort in Objective-CRobust Bubble Sort in VBAMeasuring the time for the bubble sort algorithmCustom sorting algo / optimized bubble sortBubble and Cocktail sort

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

2

1

$begingroup$

I'm trying to figure out what to call this sorting algorithm:

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

I wrote it while trying to figure out bubble sort which is a lot different. Tho will have slightly the same running time as the actual bubble sort. I might be wrong :(

javascript algorithm sorting

share|improve this question

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

2

1

$begingroup$

I'm trying to figure out what to call this sorting algorithm:

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

I wrote it while trying to figure out bubble sort which is a lot different. Tho will have slightly the same running time as the actual bubble sort. I might be wrong :(

javascript algorithm sorting

share|improve this question

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

I'm trying to figure out what to call this sorting algorithm:

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

I wrote it while trying to figure out bubble sort which is a lot different. Tho will have slightly the same running time as the actual bubble sort. I might be wrong :(

javascript algorithm sorting

share|improve this question

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

function sort(array) 
 array = array.slice();

 for (let i = 0; i < array.length; i++) 
 for (let j = 0; j < array.length - 1; j++) 
 if (array[j] > array[i]) 
 //swap
 [array[i], array[j]] = [array[j], array[i]]
 
 
 

 return array;


console.log(sort([8, 4, 5, 2, 3, 7]));

share|improve this question

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|improve this question

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

edited 6 hours ago

200_success

131k17157422

edited 6 hours ago

200_success

131k17157422

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

New contributor

Ademola Adegbuyi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 7 hours ago

Ademola AdegbuyiAdemola Adegbuyi

1135

1 Answer
1

active

oldest

votes

3

$begingroup$

To me, that's exactly Bubblesort: it takes care the largest element moves to the end of the array, and then operates on length-1 elements.

Edit: this does look quite similar to Bubblesort, but - as a diligent reader noticed - is not quite Bubblesort, as the algorithm does not compare (and swap) adjacent elements (which indeed is the main characteristic of Bubblesort). If you replace array[j] > array[i] with array[j] > array[j+1], you will get Bubblesort.

This implementation will fail if less than two input elements are given (0 or 1) - hint: the array is already sorted in these cases (just add an if).

A small improvement would be to add a flag in the i loop which records if any swapping happened at all - the outer for loop may terminate if the inner loop didn't perform any swaps. (Time) performance of Bubblesort is considered to be awful in comparison to other algorithms, but it must be noted it's the fastest algorithm on an already sorted array - if you add that flag ;)

share|improve this answer

edited 4 hours ago

answered 6 hours ago

jvbjvb

879210

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  So, I visualized the execution on pythontutor.com. One should "never" use this. It's worse than the unoptimized version of bubble sort. I goes forth and back, which takes more time. Thanks!
  $endgroup$
  – Ademola Adegbuyi
  6 hours ago
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  No. One of the defining characteristics of Bubble sort is that it swaps adjacent elements — which is not the case with this code.
  $endgroup$
  – 200_success
  5 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @200_success you are absolutely right - about to edit my answer :)
  $endgroup$
  – jvb
  4 hours ago
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
);
);
, "mathjax-editing");

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: "196"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
);



);

Ademola Adegbuyi is a new contributor. Be nice, and check out our Code of Conduct.

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

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217017%2fpossibly-bubble-sort-algorithm%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

3

$begingroup$

To me, that's exactly Bubblesort: it takes care the largest element moves to the end of the array, and then operates on length-1 elements.

Edit: this does look quite similar to Bubblesort, but - as a diligent reader noticed - is not quite Bubblesort, as the algorithm does not compare (and swap) adjacent elements (which indeed is the main characteristic of Bubblesort). If you replace array[j] > array[i] with array[j] > array[j+1], you will get Bubblesort.

This implementation will fail if less than two input elements are given (0 or 1) - hint: the array is already sorted in these cases (just add an if).

A small improvement would be to add a flag in the i loop which records if any swapping happened at all - the outer for loop may terminate if the inner loop didn't perform any swaps. (Time) performance of Bubblesort is considered to be awful in comparison to other algorithms, but it must be noted it's the fastest algorithm on an already sorted array - if you add that flag ;)

share|improve this answer

edited 4 hours ago

answered 6 hours ago

jvbjvb

879210

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  So, I visualized the execution on pythontutor.com. One should "never" use this. It's worse than the unoptimized version of bubble sort. I goes forth and back, which takes more time. Thanks!
  $endgroup$
  – Ademola Adegbuyi
  6 hours ago
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  No. One of the defining characteristics of Bubble sort is that it swaps adjacent elements — which is not the case with this code.
  $endgroup$
  – 200_success
  5 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @200_success you are absolutely right - about to edit my answer :)
  $endgroup$
  – jvb
  4 hours ago
  

  
  
  
  

add a comment | 

3

$begingroup$

To me, that's exactly Bubblesort: it takes care the largest element moves to the end of the array, and then operates on length-1 elements.

Edit: this does look quite similar to Bubblesort, but - as a diligent reader noticed - is not quite Bubblesort, as the algorithm does not compare (and swap) adjacent elements (which indeed is the main characteristic of Bubblesort). If you replace array[j] > array[i] with array[j] > array[j+1], you will get Bubblesort.

This implementation will fail if less than two input elements are given (0 or 1) - hint: the array is already sorted in these cases (just add an if).

A small improvement would be to add a flag in the i loop which records if any swapping happened at all - the outer for loop may terminate if the inner loop didn't perform any swaps. (Time) performance of Bubblesort is considered to be awful in comparison to other algorithms, but it must be noted it's the fastest algorithm on an already sorted array - if you add that flag ;)

share|improve this answer

edited 4 hours ago

answered 6 hours ago

jvbjvb

879210

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  So, I visualized the execution on pythontutor.com. One should "never" use this. It's worse than the unoptimized version of bubble sort. I goes forth and back, which takes more time. Thanks!
  $endgroup$
  – Ademola Adegbuyi
  6 hours ago
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  No. One of the defining characteristics of Bubble sort is that it swaps adjacent elements — which is not the case with this code.
  $endgroup$
  – 200_success
  5 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @200_success you are absolutely right - about to edit my answer :)
  $endgroup$
  – jvb
  4 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

To me, that's exactly Bubblesort: it takes care the largest element moves to the end of the array, and then operates on length-1 elements.

Edit: this does look quite similar to Bubblesort, but - as a diligent reader noticed - is not quite Bubblesort, as the algorithm does not compare (and swap) adjacent elements (which indeed is the main characteristic of Bubblesort). If you replace array[j] > array[i] with array[j] > array[j+1], you will get Bubblesort.

This implementation will fail if less than two input elements are given (0 or 1) - hint: the array is already sorted in these cases (just add an if).

A small improvement would be to add a flag in the i loop which records if any swapping happened at all - the outer for loop may terminate if the inner loop didn't perform any swaps. (Time) performance of Bubblesort is considered to be awful in comparison to other algorithms, but it must be noted it's the fastest algorithm on an already sorted array - if you add that flag ;)

share|improve this answer

edited 4 hours ago

answered 6 hours ago

jvbjvb

879210

$endgroup$

share|improve this answer

edited 4 hours ago

answered 6 hours ago

jvbjvb

879210

answered 6 hours ago

jvbjvb

879210

answered 6 hours ago

jvbjvb

879210