Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you may not be able to execute some actions.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

What do you need so much sorting algorithms for?

Analeea last edited by

There's a bunch of effective algorithms of sorting, and I remember, "Hoara, merger, Piramidal." Someone's stable, someone's gone. What are they so many for?
Reply Quote 0
1 Reply Last reply
T
terrea last edited by
Why do you need so many different phone or machine models? Same reason. Someone needs a little higher, someone a little easier.
The algorithms are the same story. Different people have come up with their algorithms for their specific tasks. Some algorithms are good for large volumes, others are for almost adorable data, third when there is a lot of memory, or when memory is implicated.
- http://habrahabr.ru/post/133996/
- http://habrahabr.ru/post/156361/
Reply Quote 0
1 Reply Last reply

2
Posts

0
Views

Suggested Topics

G

We need to bury and sort the mass on the basis of a given order.
Software Programming • javascript functions massives • • guilherme

2

0
Votes

2
Posts

0
Views

J

Is that it?let arr = ["HTML", "JavaScript", "CSS"]; function copySorted(array) { const copiedArray = [...array]; return copiedArray.sort((a, b) => a.length - b.length); } let sorted = copySorted(arr); alert( sorted ); // CSS, HTML, JavaScript alert( arr ); // HTML, JavaScript, CSS (без изменений)
Books on the deepest architecture of the processor
Software Programming • algorithm books processors • • jeanid

2

0
Votes

2
Posts

0
Views

J

There are Tanenbaum books on computer architecture, modern operating systems.
How do we sort the function(string param for sort,bool asc/desc)?
Software Programming • c sharp linq entity framework core • • Analeea

2

0
Votes

2
Posts

0
Views

Like that.static IOrderedQueryable<T> AddSort<T, V>( IQueryable<T> seq, Expression<Func<T, V>> fieldExtractor, bool ascending) => ascending ? seq.OrderBy(fieldExtractor) : seq.OrderByDescending(fieldExtractor); Use this:IQueryable<Entity> entities = ...; var sortedEntities = AddSort(entities, e => e.Weight, ascending: true); AddSort could be expanded.If you want to get it. Expression On behalf of properties, for example:static Expression<Func<TEntity, TValue>> CreateProjector<TEntity, TValue>( string propertyName) { var entity = Expression.Parameter(typeof(TEntity), "e"); var property = Expression.Property(entity, propertyName); var extractor = Expression.Lambda<Func<TEntity, TValue>>(property, entity); return extractor; } Accordingly, use should be made of:IQueryable<Entity> entities = ...; var projector = CreateProjector<Entity, double>("Weight"); var sortedEntities = AddSort(entities, projector, ascending: true); If the type of properties is not known in advance, you can, for example, download the value. doublebut it'll lead to a non-optimal SQL. More precision uses reflexia to cause OrderBy Synthesis:static IOrderedQueryable<TEntity> AddSortByPropertyName<TEntity>( IQueryable<TEntity> seq, string propertyName, bool ascending) { var entityType = typeof(TEntity); // часть 1, строим expression как и раньше var entity = Expression.Parameter(entityType, "e"); var property = Expression.Property(entity, propertyName); Type propertyType = property.Type; Type projectorType = typeof(Func<,>).MakeGenericType(entityType, propertyType); var extractor = Expression.Lambda(projectorType, property, entity); // в этой точке тип extractor'а нам известен лишь во время выполнения // часть 2, обобщённый вызов OrderBy var methodName = ascending ? nameof(Queryable.OrderBy) : nameof(Queryable.OrderByDescending); // нам нужен метод с такой вот сигнатурой // IQueryable<TSource> source, Expression<Func<TSource, TKey>> keySelector // но это обобщённый метод, приходится искать его по имени и количеству параметров var genericMethodInfo = typeof(Queryable) .GetMethods(BindingFlags.Public | BindingFlags.Static) .Single(mi => mi.Name == methodName && mi.GetParameters().Length == 2); // если Single вылетает, придётся строить более жёсткие условия // имея обобщённый метод, строим его конкретную инстанциацию var methodInfo = genericMethodInfo.MakeGenericMethod(entityType, propertyType); // и вызываем var result = methodInfo.Invoke(null, new object[] { seq, extractor }); return (IOrderedQueryable<TEntity>)result; } Use this:IQueryable<Entity> entities = ...; var sortedEntities = AddSortByPropertyName(entities, "Weight", ascending: true);
O

We need to write algorithms to find Delta Y for Newton polynom.
Software Programming • c++ mathematics • • Oba22

2

0
Votes

2
Posts

0
Views

N

In fact, the problem solved this code. for (int i = 0; i < n; i++) { dY[i][0] = Y[i + 1] - Y[i]; } int k = 1; for (int l = 0; l < n - 1; l++) { for (int o = 0; o < n; o++) { dY[o][k] = dY[o + 1][k - 1] - dY[o][k - 1]; } k++; } This code still needs to be edited, and it doesn't work very well, but he thinks it's necessary.
E

Clever way to order a json item by key in postgresql (two examples)
SQL, Database Testing • postgresql json sorting order by • • emran

2

0
Votes

2
Posts

0
Views

C

Be aware that order of array items is a different issue than order of keys in JSON object. See: How to sort objects in an array inside a json or jsonb value by a property of the objects? For your first example (implying integer sort), simply casting to jsonb would do the job. It happens to sort keys the way you want by default: SELECT jsonitem::jsonb FROM jsontable; db<>fiddle here Or use jsonb instead of json to begin with. However, it's not strictly integer sort. Keys are strings. Shorter keys sort before longer keys, which works as desired with only digits. But not necessarily with anything else. Like negative numbers: 2, 3, -1 Then again, your solution does string sort according to the default collation, i.e. breaks integer sort for numbers not comprised of the same number of digits: 111, 22, 3 You didn't specify exactly. This would do integer sort properly: select id, json_object_agg(key, value) AS jsonitem from ( select id, key, value from tbl ORDER BY id, key::int -- !!! ) tbl group by id; Of course, the cast to integer raises an exception for any string that's not a legal integer representation. Sorting in a subquery once as this is typically much faster than the per-item sort you get from an added ORDER BY in an aggregate function. This works, because, quoting the manual: Alternatively, supplying the input values from a sorted subquery will usually work. See: Is it REALLY possible that the order will not be guaranteed for this particular redundant derived table? Customize jsonb key sort order involving arrays Your second example is a different beast, trying to sort an array with JSON objects by the (single!?) nested key. You could reorder arrays like this: SELECT j.id, arr.js_sorted FROM jsonarr j CROSS JOIN LATERAL ( SELECT json_agg(value) AS js_sorted FROM ( SELECT * FROM json_array_elements(j.jsonitem) ORDER BY (value->>'key')::int -- true integer sort! ) sub ) arr; It really depends on where your values come from, what they can be exactly, and how you want to sort exactly.
P

Reporting algorithm
Software Programming • javascript php algorithm • • Pearlaqua

2

0
Votes

2
Posts

0
Views

M

Make a sample. 100 random values from 0 before 1 with normal distribution, you're gonna have to sort it out in a growing order and multiply every number, say, in a cut. [07:15, 23:30]. If anything, multiplication. Number ♪ cut - it's not a strict mathematical surgery. :)You'll get the sequence of the species. {07:18, 07:23, 07:43, ...}and that's when you need to send messages.
O

Type x(n+1)=a*x(n)+b(mod127)
Software Programming • algorithm c+++ • • Oba22

2

0
Votes

2
Posts

0
Views

O

who prevents the creation of a class in which one field of the whole type where the current state will be stored, a single-metre designer that will display this condition and one method, such asclass Generator { private: int curr; // поле текущего значения public: int getNext() { int x = (10*curr + 11) % 127; // тут я не ручаюсь, что точно расшифровал формулу // но по идее, именно так должно быть curr = x; return x; } int getCurrent() { return curr; } Generator(int start) { curr = start % 127; // поделим сразу, что бы точно было в заданном диапазоне. } } I think you can do it yourself.
The Levenstein system is returning an unexpected result.
Software Programming • javascript node.js algorithm levenshtein • • inna

2

0
Votes

2
Posts

0
Views

A

This issue is a continuation of the question. https://ru.stackoverflow.com/questions/1187249/%D0%9A%D0%B0%D0%BA-%D0%BD%D0%B0%D0%B9%D1%82%D0%B8-%D1%81%D0%B0%D0%BC%D1%8B%D0%B9-%D0%BF%D0%BE%D1%85%D0%BE%D0%B6%D0%B8%D0%B9-string-%D0%B2-array This and the answer to it is a continuation of the reply.In the past, I showed how to use it. https://ru.wikipedia.org/wiki/%D0%A0%D0%B0%D1%81%D1%81%D1%82%D0%BE%D1%8F%D0%BD%D0%B8%D0%B5_%D0%9B%D0%B5%D0%B2%D0%B5%D0%BD%D1%88%D1%82%D0%B5%D0%B9%D0%BD%D0%B0 (not the author) and https://ru.wikipedia.org/wiki/%D0%A1%D1%85%D0%BE%D0%B4%D1%81%D1%82%D0%B2%D0%BE_%D0%94%D0%B6%D0%B0%D1%80%D0%BE_%E2%80%94_%D0%92%D0%B8%D0%BD%D0%BA%D0%BB%D0%B5%D1%80%D0%B0 ♪I'll show you how to use it. https://ru.wikipedia.org/wiki/%D0%A1%D1%82%D0%B5%D0%BC%D0%BC%D0%B8%D0%BD%D0%B3 to make it easier to find coincidences (Stemmer is a thing that turns "Bota," "bottom" into "bottom." Well, if that word is in his dictionary, or if he's guessing the rules on which to find the "found" word) https://ru.wikipedia.org/wiki/%D0%9A%D0%BE%D1%8D%D1%84%D1%84%D0%B8%D1%86%D0%B8%D0%B5%D0%BD%D1%82_%D0%A1%D1%91%D1%80%D0%B5%D0%BD%D1%81%D0%B5%D0%BD%D0%B0 Plus, as compared to the previous reply, the search for a maximum overlap is now one way, no sorting.const natural = require('natural'); natural.PorterStemmerRu.attach(); const userMessage = 'пешу в ппаддержку11! бот-заебот! надоели баги вашего ббота!'; const arr = userMessage.tokenizeAndStem(); // ["пеш","паддержку11","бот","заебот","надоел","баг","ваш","ббот"] ['поддержка', 'бот', 'ытот'].forEach((str) => { console.log('[d]', str, '->', compareDiceCoefficient(str, arr, 0.5)); console.log('[j]', str, '->', compareJaroWinkler(str, arr, 0.7)); }); function compareDiceCoefficient(str, arr, lowerLimit = 0.05) { // arr.forEach((x) => console.log('[d]', x, natural.DiceCoefficient(str, x))); const reduced = arr.reduce((acc, x) => { const dt = natural.DiceCoefficient(str, x); if (acc.dt < dt && dt > lowerLimit) { acc.dt = dt; acc.w = x; } return acc; }, {dt: -Infinity, w: null}); return reduced.w; } function compareJaroWinkler(str, arr, lowerLimit = 0.05) { // arr.forEach((x) => console.log('[j]', x, natural.JaroWinklerDistance(str, x, undefined, true))); const reduced = arr.reduce((acc, x) => { const dt = natural.JaroWinklerDistance(str, x, undefined, true); if (acc.dt < dt && dt > lowerLimit) { acc.dt = dt; acc.w = x; } return acc; }, {dt: -Infinity, w: null}); return reduced.w; } [d] поддержка -> ппаддержку11 [j] поддержка -> ппаддержку11 [d] бот -> бот [j] бот -> бот [d] ытот -> null [j] ытот -> null
B

I need to build an algorithm to adjust an arrangement
Software Programming • pseint • • Burma

2

0
Votes

2
Posts

0
Views

D

Bubble is an algorithm that orders a list of a movement at a time. Therefore, you will visit the list as many times as necessary until the list is fully ordered.To do this, a flag is used that clarifies if any movement was made, and the point-to-end list is run by moving the necessary elements.In pseudocode, the algorithm comes as follows:flag = true Mientras flag = true flag = false Desde iniciolista hasta finlista-1 si posicionactual < posicionactual+1 cambiar las posiciones flag = true fin si fin desde fin mientras Note that this commands the entire list from greater to less and runs it as many times as necessary.Now, with the theme of spaces, it already depends on language. In general all languages treat spaces as minor characters than numbers and letters, therefore a system should leave the spaces to the bottom. However, if not the case, one should send the spaces to the bottom before doing this, and count them, and take as the end of the list, the last space that is not white.
E

Safely share passwords between users
Security, Penetration Testing • net encryption algorithm cryptography hash • • emerson

2

0
Votes

2
Posts

0
Views

S

Don't invent your own cryptographic protocols. It's easy to come up with all kinds of ideas and combine all kinds of techniques, but doing this properly is exceptionally hard and requires a lot of experience and extensive peer reviews. This isn't something you can do on your own in a few minutes, especially if you don't happen to be a cryptographer. What confirms this impression is that you jump straight to random implementation details before you've even analyzed the problem and specified the goal. How is the nested encryption feature relevant at this early stage? This all sounds rather chaotic and vague. I strongly recommend that you first get clear about the bigger picture and then choose an established solution for this specific scenario.
E

How do "while" repeat itself 4 times only and break pro next command in C?
Software Programming • c language algorithm condition • • esther

2

0
Votes

2
Posts

0
Views

A

You have some mistakes in this code. I think I should use a for in this case, but may have been required to use one while.I organized and gave more significant names for the variables. The sum is not within the loop so it is not adding in every step that takes a new number.The sum was not initialized with 0 then can take a random value in memory and in some cases go very wrong, not at all, and that is the worst part.The condition is not checking if the count is going up to 4.#include <stdio.h> int main(void) { int contador = 0, soma = 0; while (contador < 4) { int numero; printf("Digite o número: "); scanf("%d", &numero); contador++; soma += numero; } printf("A soma entre os valores digitados é de: %d", soma); } See https://ideone.com/fQ4LAW . And https://repl.it/@maniero/LoopSumc . Also https://github.com/maniero/SOpt/blob/master/C/Algorithm/LoopSum.c .
B

Can anyone help me with the sorting algorithm by selection?
Software Programming • javascript • • Burma

2

0
Votes

2
Posts

0
Views

J

The problem is that you're not properly implementing https://es.wikipedia.org/wiki/Ordenamiento_por_selecci%C3%B3n The pseudocode is this:para i=0 hasta n-1 mínimo = i; para j=i+1 hasta n si lista[j] < lista[mínimo] entonces mínimo = j /* (!) */ fin si fin para intercambiar(lista[i], lista[mínimo]) fin para You have to initialize a minimum value (it will initially be zero) with which to compare the values of your array:function num(arr) { for(let i = 0; i < arr.length; i++) { let min=i; for(let x = i + 1; x < arr.length; x++) { if (arr[min] > arr[x]) { min = x; } } a(arr, i, min); } return arr; } function a(arr, f, s) { console.log(arr.toString()); var temp = arr[f]; arr[f] = arr[s]; arr[s] = temp; } document.getElementById("alg").innerHTML = num([8, 5, 2, 6, 9, 3, 1, 4, 0, 7]);<h2 id="alg"></h2>Edit: Add an example using https://developer.mozilla.org/es/docs/Web/JavaScript/Referencia/Operadores/Destructuring_assignment . With this you save the variable temp and function afunction num(arr) { for(let i = 0; i < arr.length; i++) { let min=i; for(let x = i + 1; x < arr.length; x++) { if (arr[min] > arr[x]) { min = x; } } console.log(arr.toString()); [arr[min],arr[i]] = [arr[i],arr[min]] } return arr; } document.getElementById("alg").innerHTML = num([8, 5, 2, 6, 9, 3, 1, 4, 0, 7]);<h2 id="alg"></h2>
N

Do I need flash?
Software Programming • javascript html css flash • • nishika

2

0
Votes

2
Posts

0
Views

M

Please follow these references:codepen.io/progrape/pen/XXBwWe - Your casejsfiddle.net/ArtBIT/WUXDb/1/ https://stackoverflow.com/questions/25907163/html5-canvas-eraser-tool-without-overdraw-white-color
S

How do you sort it?
Software Programming • sql delphi delphi 7 • • simrah

2

0
Votes

2
Posts

0
Views

O

SELECT * (SELECT * FROM "director_2.db" director_2 WHERE (model = :model ) UNION SELECT * FROM "buh_2.db" buh_2 WHERE (model = :model ) ) order by 'некое поле' desc Try that.
Remove the mass of the numbers without repetition
Software Programming • c++ algorithm liabilities • • carriann

2

0
Votes

2
Posts

0
Views

J

He is. adhesive - only change of values:int main(int argc, const char * argv[]) { int a[] = {1,1,1,2,2,3,4,5,5,5,5,6,7,8,8,8}; cout << a[0] << " "; for(int last = a[0], i = 1; i < sizeof(a)/sizeof(a[0]); ++i) { if (a[i] == last) continue; cout << (last = a[i]) << " "; } cout << endl; } Or, using a standard library, one line:copy(begin(a),unique(begin(a),end(a)),ostream_iterator<int>(cout," "));

What do you need so much sorting algorithms for?

Suggested Topics

We need to bury and sort the mass on the basis of a given order. Software Programming • javascript functions massives • • guilherme

Books on the deepest architecture of the processor Software Programming • algorithm books processors • • jeanid

How do we sort the function(string param for sort,bool asc/desc)? Software Programming • c sharp linq entity framework core • • Analeea

We need to write algorithms to find Delta Y for Newton polynom. Software Programming • c++ mathematics • • Oba22

Clever way to order a json item by key in postgresql (two examples) SQL, Database Testing • postgresql json sorting order by • • emran

Reporting algorithm Software Programming • javascript php algorithm • • Pearlaqua

Type x(n+1)=a*x(n)+b(mod127) Software Programming • algorithm c+++ • • Oba22

The Levenstein system is returning an unexpected result. Software Programming • javascript node.js algorithm levenshtein • • inna

I need to build an algorithm to adjust an arrangement Software Programming • pseint • • Burma

Safely share passwords between users Security, Penetration Testing • net encryption algorithm cryptography hash • • emerson

How do "while" repeat itself 4 times only and break pro next command in C? Software Programming • c language algorithm condition • • esther

Can anyone help me with the sorting algorithm by selection? Software Programming • javascript • • Burma

Do I need flash? Software Programming • javascript html css flash • • nishika

How do you sort it? Software Programming • sql delphi delphi 7 • • simrah

Remove the mass of the numbers without repetition Software Programming • c++ algorithm liabilities • • carriann

We need to bury and sort the mass on the basis of a given order.
Software Programming • javascript functions massives • • guilherme

Books on the deepest architecture of the processor
Software Programming • algorithm books processors • • jeanid

How do we sort the function(string param for sort,bool asc/desc)?
Software Programming • c sharp linq entity framework core • • Analeea

We need to write algorithms to find Delta Y for Newton polynom.
Software Programming • c++ mathematics • • Oba22

Clever way to order a json item by key in postgresql (two examples)
SQL, Database Testing • postgresql json sorting order by • • emran

Reporting algorithm
Software Programming • javascript php algorithm • • Pearlaqua

Type x(n+1)=a*x(n)+b(mod127)
Software Programming • algorithm c+++ • • Oba22

The Levenstein system is returning an unexpected result.
Software Programming • javascript node.js algorithm levenshtein • • inna

I need to build an algorithm to adjust an arrangement
Software Programming • pseint • • Burma

Safely share passwords between users
Security, Penetration Testing • net encryption algorithm cryptography hash • • emerson

How do "while" repeat itself 4 times only and break pro next command in C?
Software Programming • c language algorithm condition • • esther

Can anyone help me with the sorting algorithm by selection?
Software Programming • javascript • • Burma

Do I need flash?
Software Programming • javascript html css flash • • nishika

How do you sort it?
Software Programming • sql delphi delphi 7 • • simrah

Remove the mass of the numbers without repetition
Software Programming • c++ algorithm liabilities • • carriann