blocks|key|2890167|text|你可以的|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2890168|memmove(&array[i%2B1],+&array[i],+(size+-+i)+*+sizeof+array[i]);|code-block|syntax|javascript|2890169|编辑：|2890170|不需要999技巧；只需在size中记录使用的元素数量(并添加适当的边界检查)。|offset|length|style|CODE|2890171|entityMap^0|0|0|0|3|3|C|4|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|S|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|T|8|@$K|U|L|V|M|N]|$K|W|L|X|M|N]]|9|@]|A|$]]|$1|O|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|P|$]]

you can

<pre><code>memmove(&amp;array[i+1], &amp;array[i], (size - i) * sizeof array[i]);
</code></pre>

EDIT:

The <code>999</code> trick is not needed; just record the number of used elements in <code>size</code> (and add appropriate boundary checks).

blocks|key|2067459|text|为了将后面的所有数组元素向前移动一步，必须向后遍历数组，这样才不会覆盖这些元素。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2067460|一旦你得到了索引，|2067461|int+i+=+size;
while+(+i+>+index+)+{
++array[i]+=+array[i-1];
++i--;
}
array[i]+=+number;
size%2B%2B;|code-block|syntax|javascript|2067462|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

In order to move all the latter array elements one step ahead, you will have to traverse the array backwards so that you do not over-write the elements.

Once you get the index,

<pre><code>int i = size;
while ( i &gt; index ) {
 array[i] = array[i-1];
 i--;
}
array[i] = number;
size++;
</code></pre>

blocks|key|5005116|text|//+1.+initialise+i+(the+'hole'+index)+to+the+last+element+in+the+array
//+2.+if+the+preceeding+array+element+is+larger+than+the+newValue
//+3.+++move+the+preceeding+element+into+the+'hole'+at+i,+moving+the+hole+up+a+position
//+4.+++reverse+through+the+array
//+5.+else+put+the+newValue+into+the+hole+and+we're+done+

i+=+ARRAY_SIZE-1;++
while+(i>0+&&+array[i-1]>newValue)+{
++array[i]+=+array[i-1];
++i--;
}
array[i]+=+newValue;++++++++++++++++++++++++++++|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|5005117|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>// 1. initialise i (the 'hole' index) to the last element in the array
// 2. if the preceeding array element is larger than the newValue
// 3. move the preceeding element into the 'hole' at i, moving the hole up a position
// 4. reverse through the array
// 5. else put the newValue into the hole and we're done 

i = ARRAY_SIZE-1; 
while (i&gt;0 &amp;&amp; array[i-1]&gt;newValue) {
 array[i] = array[i-1];
 i--;
}
array[i] = newValue; 
</code></pre>

blocks|key|5005108|text|要推送数组元素的其余部分，您应该使用循环。只需小心:您应该从最后一个元素开始推送，否则将为其余元素分配相同的值。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5005109|int+i=size-1;+//+Not+i=size+(this+is+the+size+of+the+array+not+the+last+index)
while+(i>index){
array[i]+=+array[i-1];
i--;
}
array[i]+=+number;|code-block|syntax|javascript|5005110|将未使用的元素赋值为999不是必需的，只需定义一个键来记住最后一个元素，并使用它来代替大小，然后在插入新元素时，只需检查是否达到了数组的大小。|5005111|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

To push the rest of the array element's you should use a loop.
Just be careful: you should start pushing from the last element otherwise you will assign the rest of elements with the same value.
<pre><code>int i=size-1; // Not i=size (this is the size of the array not the last index)
while (i&gt;index){
array[i] = array[i-1];
i--;
}
array[i] = number;
</code></pre>
about assigning the unused elements with 999 it's not required just define a key to remember the last element and use it instead of size, then when inserting a new element just check if you reached the size of the array.

blocks|key|154009|text|试试这个：-|type|unstyled|depth|inlineStyleRanges|entityRanges|data|154010|#include<stdio.h>

void+insert(int+a[],+int+size,+int+element)
{size%2B%2B;
++int+flag=0;
++for(int+i=0;i<size;i%2B%2B)
++{+
++++if(a[i]>element)
++++{flag%2B%2B;
++++++for(int+j=size;+j>=i;+j--)
++++a[j]+=+a[j-1];
++++++a[i]+=+element;
++++++break;
++++}
++}
++if+(flag+==+0)
++++a[size-1]+=+element;
++for(int+i=0;i<size;i%2B%2B)
++++printf("+%25d",+a[i]);
}

int+main()+
{
++printf("Insertion+of+elements+in+array+\n");
++int+arr[100],+size,+element;
++printf("Enter+the+size+of+array:-+");
++scanf("%25d",&size);
++printf("\nEnter+the+array(Sorted+Array!):-+");
++for(int+i=0;i<size;i%2B%2B)
++{
++++scanf("%25d",&arr[i]);
++}
++printf("\nEnter+element+you+want+to+insert:-+");
++scanf("%25d",+&element);

++insert(arr,+size,+element);
++
++++return+0;+
}+|code-block|syntax|javascript|154011|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Try this:-
<pre><code>#include&lt;stdio.h&gt;

void insert(int a[], int size, int element)
{size++;
 int flag=0;
 for(int i=0;i&lt;size;i++)
 { 
 if(a[i]&gt;element)
 {flag++;
 for(int j=size; j&gt;=i; j--)
 a[j] = a[j-1];
 a[i] = element;
 break;
 }
 }
 if (flag == 0)
 a[size-1] = element;
 for(int i=0;i&lt;size;i++)
 printf(&quot; %d&quot;, a[i]);
}

int main() 
{
 printf(&quot;Insertion of elements in array \n&quot;);
 int arr[100], size, element;
 printf(&quot;Enter the size of array:- &quot;);
 scanf(&quot;%d&quot;,&amp;size);
 printf(&quot;\nEnter the array(Sorted Array!):- &quot;);
 for(int i=0;i&lt;size;i++)
 {
 scanf(&quot;%d&quot;,&amp;arr[i]);
 }
 printf(&quot;\nEnter element you want to insert:- &quot;);
 scanf(&quot;%d&quot;, &amp;element);

 insert(arr, size, element);
 
 return 0; 
} 
</code></pre>

I want to insert an element into the right place that order maintains in the sorted list.
I allocated 2*n size for the array and filled the rest with 999 since they are not used currently.

<pre><code>ordered_insert(int number,int array[],int size){
 int i=0;
 int temp1,temp2,index;
 while(eleman&gt;array[i]){
 i++;}

//push the rest to right by one
index=i;

if(i&lt;size){
 temp1=array[i];
 temp2= array[i+1];
 array[i+1]=temp1;
 array[i+2]=temp2;
 i++;
 }

array[index]=number;

}
</code></pre>

I couldn't figure out how to overwrite 999s or is there a better way instead?

insert into sorted array

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我想将一个元素插入到排序列表中order维护的正确位置。我为数组分配了2*n大小，并用999填充了剩余的数组，因为它们当前并不使用。ordered_insert(int number,int array[],int size){ int i=0; int temp1,temp2,index; while(eleman>array[i]){   i++;}//push the rest to rig

问插入到排序数组中
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问插入到排序数组中EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问插入到排序数组中
EN