fix(curriculum): Improve Array Sort Challenge (#35756)
* fix(curriculum): Improve Array Sort Challenge * Update note to include in challenge description Co-Authored-By: Manish-Giri <manish.giri.me@gmail.com>
This commit is contained in:
		
				
					committed by
					
						 The Coding Aviator
						The Coding Aviator
					
				
			
			
				
	
			
			
			
						parent
						
							e6a6bb0c82
						
					
				
				
					commit
					c27dc72e4d
				
			| @@ -9,7 +9,11 @@ challengeType: 1 | |||||||
| The <code>sort</code> method sorts the elements of an array according to the callback function. | The <code>sort</code> method sorts the elements of an array according to the callback function. | ||||||
| For example: | For example: | ||||||
| <blockquote>function ascendingOrder(arr) {<br>  return arr.sort(function(a, b) {<br>    return a - b;<br>  });<br>}<br>ascendingOrder([1, 5, 2, 3, 4]);<br>// Returns [1, 2, 3, 4, 5]<br><br>function reverseAlpha(arr) {<br>  return arr.sort(function(a, b) {<br>    return a === b ? 0 : a < b ? 1 : -1;<br>  });<br>}<br>reverseAlpha(['l', 'h', 'z', 'b', 's']);<br>// Returns ['z', 's', 'l', 'h', 'b']</blockquote> | <blockquote>function ascendingOrder(arr) {<br>  return arr.sort(function(a, b) {<br>    return a - b;<br>  });<br>}<br>ascendingOrder([1, 5, 2, 3, 4]);<br>// Returns [1, 2, 3, 4, 5]<br><br>function reverseAlpha(arr) {<br>  return arr.sort(function(a, b) {<br>    return a === b ? 0 : a < b ? 1 : -1;<br>  });<br>}<br>reverseAlpha(['l', 'h', 'z', 'b', 's']);<br>// Returns ['z', 's', 'l', 'h', 'b']</blockquote> | ||||||
| Note: It's encouraged to provide a callback function to specify how to sort the array items. JavaScript's default sorting method is by string Unicode point value, which may return unexpected results. | JavaScript's default sorting method is by string Unicode point value, which may return unexpected results. Therefore, it is encouraged to provide a callback function to specify how to sort the array items. When such a callback function, normally called <code>compareFunction</code>, is supplied, the array elements are sorted according to the return value of the <code>compareFunction</code>: | ||||||
|  | If <code>compareFunction(a,b)</code> returns a value less than 0 for two elements <code>a</code> and <code>b</code>, then <code>a</code> will come before <code>b</code>. | ||||||
|  | If <code>compareFunction(a,b)</code> returns a value greater than 0 for two elements <code>a</code> and <code>b</code>, then <code>b</code> will come before <code>a</code>. | ||||||
|  | If <code>compareFunction(a,b)</code> returns a value equal to 0 for two elements <code>a</code> and <code>b</code>, then <code>a</code> and <code>b</code> will remain unchanged. | ||||||
|  |  | ||||||
| </section> | </section> | ||||||
|  |  | ||||||
| ## Instructions | ## Instructions | ||||||
|   | |||||||
		Reference in New Issue
	
	Block a user